#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define Pi pair<int,int>
#define IINF 1e9
#define LINF 1e18
#define vi vector<int>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 0, 1,0,-1 };
int dy[] = { 1, 0,-1,0 };

void isPrime(ll n) {
	if (n <= 1) {
		cout << "1 1" << endl;
		return;
	}
	if (n == 2) {
		cout << "2 1" << endl;
		return;
	}
	if (n % 2 == 0){
		cout << 2 << " " << n / 2 << endl;
		return;
	}	
	for (ll i = 3; i*i <= n; i += 2) {
		if (n%i == 0) {
			cout << i << " " << n / i << endl;
			return;
		}
	}
	cout << 1 << " " << n << endl;
	return;
}

void solve() {
	int n, k, x;
	cin >> n >> k >> x;
	vi a, b,c1,c2;
	rep(i, n) {
		c1.push_back(i + 1);
	}
	rep(i, k) {
		if (i != x - 1) {
			int A, B;
			cin >> A >> B;
			A--; B--;
			a.push_back(A);
			b.push_back(B);
		}
		else {
			char s1, s2;
			cin >> s1 >> s2;
			a.push_back(0);
			b.push_back(0);
		}
	}
	rep(i, n) {
		int A;
		cin >> A;
		c2.push_back(A);
	}

	rep(i, x-1) {
		swap(c1[a[i]], c1[b[i]]);
	}
	
	for (int i = k - 1; i >= x; i--) {
		swap(c2[a[i]], c2[b[i]]);
	}
	vi pos;
	rep(i, n) {
		if (c1[i] != c2[i])pos.push_back(i+1);
	}
	cout << pos[0] << " " << pos[1] << endl;
}

int main() {
	solve();
	return 0;
}