/*

code by: zstu wxk

time: 2019/02/22

*/

#include<bits/stdc++.h>

using namespace std;

#define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);

#define LL long long

#define ULL unsigned LL

#define fi first

#define se second

#define pb push_back

#define lson l,m,rt<<1

#define rson m+1,r,rt<<1|1

#define lch(x) tr[x].son[0]

#define rch(x) tr[x].son[1]

#define max3(a,b,c) max(a,max(b,c))

#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;

const int inf = 0x3f3f3f3f;

const int _inf = 0xc0c0c0c0;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const LL _INF = 0xc0c0c0c0c0c0c0c0;

const LL mod =  (int)1e9+;

const int N = 1e5 + ;

int n, m;

vector<int> vc[N];

vector<int> e[N];

int ind[N], vis[N], t[N], ans[N];

void init(){

    for(int i = ; i <= n; ++i) ind[i] = vis[i] = ;

    for(int i = ; i <= n; ++i){

        for(int j = ; j < e[i].size(); ++j){

            int v = e[i][j];

            ++ind[v];

        }

    }

}

int toposort(int ban){

    queue<int> q;

    for(int j = ; j < vc[n].size(); ++j){

        int v = vc[n][j];

        if(!ind[v] && v != ban){

            q.push(v);

            vis[v] = ;

        }

    }

    for(int k = n; k >= ; --k){

        if(q.empty()) return k;

        int x = q.front();

        q.pop();

        ans[k] = x;

        for(int j = ; j < e[x].size(); ++j){

            int v = e[x][j];

            if(v == ban) continue;

            ind[v]--;

            if(ind[v] ==  && t[v] >= k && !vis[v]){

                vis[v] = ;

                q.push(v);

            }

        }

        for(int j = ; j < vc[k-].size(); ++j){

            int v = vc[k-][j];

            if(v == ban) continue;

            if(!vis[v] && ind[v] == ){

                q.push(v);

                vis[v] = ;

            }

        }

    }

    return ;

}

void Ac(){

    for(int i = ; i <= n; ++i){

        scanf("%d", &t[i]);

        vc[t[i]].pb(i);

    }

    for(int i = ,u,v; i <= m; ++i){

        scanf("%d%d", &u, &v);

        e[v].pb(u);

    }

    init();

    toposort();

    for(int i = ; i <= n; ++i){

        printf("%d%c", ans[i], " \n"[i==n]);

    }

    for(int i = ; i <= n; ++i){

        init();

        printf("%d%c", toposort(i), " \n"[i==n]);

    }

}

int main(){

    while(~scanf("%d%d", &n, &m)){

        Ac();

    }

    return ;

}

/*

5 5

4 5 2 5 4

1 2

3 2

5 1

3 4

3 1

*/