#include <bits/stdc++.h>
using namespace std;

#define FOR(i,l,r) for(int i = (l);i < (r);i++)
#define ALL(x) (x).begin(),(x).end()
template<typename T> void chmax(T& a,const T& b){if(a < b) a = b;}
template<typename T> void chmin(T& a,const T& b){if(b < a) a = b;}
typedef long long ll;

int N,K,X;

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> N >> K >> X;
	vector< pair<int,int> > P(K + 1);
	for(int i = 1;i <= K;i++){
		if(i == X){
			char c,h;
			cin >> c >> h;
		}
		else{
			cin >> P [i].first >> P [i].second;
		}
	}
	vector<int> A(N + 1),C(N + 1);
	for(int i = 1;i <= N;i++){
		cin >> C [i];
		A [i] = i;
	}

	for(int i = 1;i < X;i++){
		swap(A [P [i].first],A [P [i].second]);
	}
	for(int i = K;i > X;i--){
		swap(C [P [i].first],C [P [i].second]);
	}
	vector<int> ans;
	for(int i = 1;i <= N;i++){
		if(A [i] != C [i]){
			ans.push_back(i);
		}
	}
	sort(ALL(ans));

	cout << ans [0] << " " << ans [1] << endl;

	return 0;
}