#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <iomanip>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define LONGINF 1000000000000000000
int first_one[200000] = {};
int second_one[200000] = {};
int main(){
	int n, k, x;
	cin >> n >> k >> x;
	vector<pair<int, int>> hoge;
	REP(i, k) {
		if (i != x - 1) {
			int a, b;
			cin >> a >> b;
			hoge.push_back(make_pair(a, b));
		}
		else {
			string fa, fi;
			cin >> fa >> fi;
		}
	}
	REP(i, n) {
		first_one[i + 1] = i + 1;
		cin >> second_one[i+1];
	}
	for (int i = 0;i < x - 1;++i) {
		swap(first_one[hoge[i].first], first_one[hoge[i].second]);
	}
	for (int i = hoge.size()-1;i >= x-1;--i) {
		swap(second_one[hoge[i].first], second_one[hoge[i].second]);
	}
	for (int i = 1;i <= n;++i) {
		if (first_one[i] != second_one[i]) {
			cout << i << " ";
		}
	}
	cout << endl;
	return 0;
}