#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 123450
#else
#define SIZE 123450
#endif

int N,K,X;
int A[SIZE],B[SIZE],C[SIZE],S[SIZE];
string s;

void solve() {
    cin>>N>>K>>X;
    REP(i,K) {
        if (i==X-1) cin>>s>>s;
        else {
            cin>>A[i]>>B[i];
            A[i]--,B[i]--;
        }
    }
    REP(i,N) {
        cin>>C[i];
        C[i]--;
        S[i]=i;
    }
    REP(i,X) {
        swap(S[A[i]], S[B[i]]);
    }
    RFOR(i,X,K) {
        swap(C[A[i]], C[B[i]]);
    }
    REP(i,N) {
        if (S[i]!=C[i]) out("%lld ", i+1);
    }
    out("\n");
}