#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mt make_tuple
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1e16;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){
	int n,m,k;
	cin>>n>>m>>k;
	k--;
	char c;
	vp in(m);
	rep(i,m)if(i!=k)cin>>in[i].first>>in[i].second;
	else cin>>c>>c;
	vi q(n);
	rep(i,n)q[i]=i+1;
	rep(i,k)swap(q[in[i].first-1],q[in[i].second-1]);
	vi Q(n);
	rep(i,n)cin>>Q[i];
	rep(i,m-k-1)swap(Q[in[m-i-1].first-1],Q[in[m-i-1].second-1]);
	vi out;
	rep(i,n)if(Q[i]!=q[i])out.pb(i+1);
	cout<<out[0]<<" "<<out[1]<<endl;
}