#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, k, x; cin >> n >> k >> x;
	x--;
	vector<int>p(n);
	rep(i, n)p[i] = i;
	vector<int>a(k), b(k);
	rep(i, k) {
		if (i == x) {
			char c; cin >> c >> c;
			continue;
		}
		cin >> a[i] >> b[i];
		a[i]--, b[i]--;
	}
	rep(i, x) swap(p[a[i]], p[b[i]]);
	vector<int>q(n);
	rep(i, n)cin >> q[i], q[i]--;
	rrep2(i, x + 1, k) swap(q[a[i]], q[b[i]]);
	rep(i, n)if (p[i] != q[i]) cout << i + 1 << endl;
	return 0;
}