#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>

using namespace std;

int main() {
	int n, k, x;

	cin >> n >> k >> x;
	vector<int> a(k+1, -1), b(k+1, -1);
	vector<int> c(n), d(n);
	for (int i = 1; i <= k; i++) {
		if (i == x) {
			string tmp;
			cin >> tmp >> tmp;
			continue;
		}
		cin >> a[i] >> b[i];
		a[i]--;
		b[i]--;
	}
	for (int i = 0; i < n; i++) {
		d[i] = i + 1;
		cin >> c[i];
	}

	for (int i = 1; i < x; i++) {
		swap(d[a[i]], d[b[i]]);
	}
	for (int i = k; i > x; i--) {
		swap(c[a[i]], c[b[i]]);
	}

	vector<int> ans;
	for (int i = 0; i < n; i++) {
		if (c[i] != d[i]) {
			ans.push_back(i+1);
		}
	}

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

	return 0;
}