#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

int n, k, x;


int main(){
	cin >> n >> k >> x;

	vector<int>seq(101010);
	vector<int>c(101010);
	vector<pair<int, int>>a_b(101010);
	rep(i, 0, n)seq[i] = i;

	string g1, g2;
	rep(i, 0, k) {
		if (i == x - 1) {
			cin >> g1 >> g2;
			a_b[i] = make_pair(-1,-1);
		}
		else {
			int a, b;
			cin >> a >> b;
			a--, b--;
			a_b[i] = make_pair(a, b);
		}
	}

	rep(i, 0, n) {
		int C;
		cin >> C;
		C--;
		c[i] = C;
	}


	int cnt1 = 0;
	while (1) {
		if (a_b[cnt1].first == -1)break;
		swap(seq[a_b[cnt1].first],seq[a_b[cnt1].second]);
		cnt1++;
	}

	int cnt2 = k - 1;
	while (1) {
		if (a_b[cnt2].first == -1)break;
		swap(c[a_b[cnt2].first],c[a_b[cnt2].second]);
		cnt2--;
	}

	rep(i, 0, n) {
		if (c[i] != seq[i])cout << i + 1 << " ";
	}
	cout << endl;

	return 0;
}