#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define mt make_tuple
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
#define ce(x, y) (x + y - 1) / y
#define print(t) cout << (t) << "\n";
#define printk(v) {rep(i, 0, len(v) - 1) { cout << v[i] << " "; } cout << v.back() << endl;}
int main() {
	int n, k, x; cin >> n >> k >> x;
	vi v(n + 1, 0); rep(i, 1, n + 1) v[i] = i;
	int a, b;
	rep(i, 0, x - 1) {
		cin >> a >> b;
		swap(v[a], v[b]);
	}
	char c; cin >> c >> c;
	vector<pair<int, int>> ab;
	rep(i, 0, k - x) {
		cin >> a >> b;
		ab.eb(mp(a, b));
	}
	reverse(all(ab));
	vi C(n + 1, 0); rep(i, 0, n) cin >> C[i + 1];
	for(auto z: ab) {
		swap(C[z.fi], C[z.se]);
	}
	vi ans;
	rep(i, 1, n + 1) {
		if (v[i] != C[i]) ans.eb(i);
	}
	sort(all(ans));
	cout << ans[0] << " " << ans[1] << endl;
	return 0;
}