#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>

typedef long long ll;

using namespace std;

int start[100001];
int finsh_line[100001];

int main() {

	int n, k, x;
	cin >> n >> k >> x;

	for (int i = 1; i <= n; i++) {
		start[i] = i;
	}

	stack<pair<int, int> > st;

	int l = 0, r = 0;
	for (int i = 1; i <= k; i++) {
		if (i < x) {
			cin >> l >> r;

			int tmp = start[l];

			start[l] = start[r];

			start[r] = tmp;

		}

		if (i == x) {
			string s;
			cin >> s >> s;
		}

		if (i > x) {
			cin >> l >> r;

			pair<int, int> pr;
			pr = make_pair(l, r);

			st.push(pr);

		}

	}
	for (int i = 1; i <= n; i++) {
		int tmp = 0;
		cin >> tmp;
		finsh_line[i] = tmp;
	}

	for (int i = 0; i < k - x; i++) {
		pair<int, int> pr;

		pr = st.top();
		st.pop();

		int tmp = finsh_line[pr.first];

		finsh_line[pr.first] = finsh_line[pr.second];

		finsh_line[pr.second] = tmp;
	}

	int ans_l = 0, ans_r = 0;
	for (int i = 1; i <= n; i++) {

		if (start[i] != finsh_line[i]) {

			if (ans_l == 0) {
				ans_l = i;
			} else {
				ans_r = i;
			}

		}
	}

	cout << ans_l << " " << ans_r << endl;

	return 0;
}