#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N; int K; int X;
	while(~scanf("%d%d%d", &N, &K, &X)) {
		vector<int> perm(N);
		iota(perm.begin(), perm.end(), 0);
		rep(i, X - 1) {
			int A; int B;
			scanf("%d%d", &A, &B), -- A, -- B;
			swap(perm[A], perm[B]);
		}
		char dummy[2];
		scanf("%s%s", dummy, dummy);
		vpii v(K - X);
		rep(i, K - X) {
			int A; int B;
			scanf("%d%d", &A, &B), -- A, -- B;
			v[i] = { A, B };
		}
		vector<int> iperm(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &iperm[i]), -- iperm[i];
		reverse(v.begin(), v.end());
		for(auto p : v)
			swap(iperm[p.first], iperm[p.second]);
		vi ans;
		rep(i, N) if(perm[i] != iperm[i])
			ans.push_back(i);
		for(int i = 0; i < (int)ans.size(); ++ i) {
			if(i != 0) putchar(' ');
			printf("%d", ans[i] + 1);
		}
		puts("");
	}
	return 0;
}