#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define MT make_tuple
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()

int main() {

	int N, K, X;
	cin >> N >> K >> X;
	X--;

	VI A(K), B(K);
	REP(i, K){
		if(i != X){
			cin >> A[i] >> B[i];
			A[i]--;
			B[i]--;
		}
		else{
			char a;
			cin >> a >> a;
		}
	}

	VI E(N), S(N);
	REP(i, N){
		S[i] = i;
		cin >> E[i];
		E[i]--;
	}

	REP(i, X){
		swap(S[A[i]], S[B[i]]);
//		EACH(s, S) cout << s << " ";
//		cout << endl;
	}

//	cout << endl;

	REP(i, K - X - 1){
		swap(E[A[K - 1 - i]], E[B[K - 1 - i]]);
//		EACH(e, E) cout << e << " ";
//		cout << endl;
	}

	REP(i, N){
		if(S[i] != E[i]){
			cout << i + 1 << " ";
		}
	}

	cout << endl;

	return 0;
}