#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

int n,m;
vector<int> revGraph[100111];
pair<int,int> val[100111];
int reach[100111];

void DFS(int ver,int val)
{
    if (reach[ver] != -1)
        return;

    reach[ver] = val;

    int i;

    for (i=0;i<revGraph[ver].size();i++)
    {
        DFS(revGraph[ver][i], val);
    }

    return;
}

int main()
{
    freopen("promotion.in","r",stdin);
    freopen("promotion.out","w",stdout);

    int i,j;
    int a,b;

    scanf("%d %d",&n,&m);

    for (i=1;i<=n;i++)
    {
        scanf("%d",&val[i].first);

        val[i].second = i;

        reach[i] = -1;
    }

    for (i=1;i<=m;i++)
    {
        scanf("%d %d",&a,&b);

        revGraph[b].push_back(a);
    }

    sort(val+1,val+1+n);
    reverse(val+1,val+1+n);

    for (i=1;i<=n;i++)
    {
        DFS(val[i].second,val[i].first);
    }

    for (i=1;i<=n;i++)
    {
        if (i != 1)
            printf(" ");

        printf("%d",reach[i]);
    }

    return 0;
}