#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<60;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int N, K, X;
int a[112345], b[112345];
int c[112345], revc[112345];

int main() {
	cin >> N >> K >> X;
	X--;
	REP(i, K) {
		if (i == X) {
			string s;
			cin >> s >> s;
		}
		else {
			scanf("%d %d", a + i, b + i);
			a[i]--; b[i]--;
		}
	}
	REP(i, N) scanf("%d", c + i);
	
	for (int i = K - 1; i > X; i--) swap(c[a[i]], c[b[i]]);
	
	REP(i, N) revc[i] = i + 1;
	REP(i, X) swap(revc[a[i]], revc[b[i]]);
	
	vector<int> ans;
	
	REP(i, N) if (c[i] != revc[i]) ans.push_back(i + 1);
	
	sort(ALL(ans));
	
	printf("%d %d\n", ans[0], ans[1]);
	
	return 0;
}