#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;


void solve()
{	
	int n,k,x;
	cin>>n>>k>>x;
	vector<int>a(k),b(k);
	vector<int>pos(n);
	rep(i,n)pos[i]=i;
	rep(i,k){
		if(i!=x-1)cin>>a[i]>>b[i],a[i]--,b[i]--;
		else {
			char c,d;
			cin>>c>>d;
		}
	}
	vector<int>c(n);
	rep(i,n)cin>>c[i],c[i]--;
	rep(i,x-1){
		swap(pos[a[i]],pos[b[i]]);
	}
	for(int i=k-1;i>=x;--i){
		swap(c[a[i]],c[b[i]]);
	}
	int e=-1,y;
	rep(i,n){
		if(pos[i]!=c[i]){
			if(e==-1){
				e=i+1;
			}
			else{
				y=i+1;
			}
		}
	}
	cout<<e<<" "<<y<<"\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}