#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    int n,k,x;
    cin >> n >> k >> x;
    x--;
    vi a(k),b(k);
    rep(i,k){
        if(i == x){
            string s;
            cin >> s >> s;
        }else{
            cin >> a[i] >> b[i];
            a[i]--,b[i]--;
        }
    }
    vi p(n),q(n);
    rep(i,n)p[i] = i+1;
    rep(i,x)swap(p[a[i]],p[b[i]]);
    //rep(i,n)cout << " " << p[i];cout << endl;
    rep(i,n)cin >> q[i];
    for(int i = k-1; i > x; i--)swap(q[a[i]],q[b[i]]);
    //rep(i,n)cout << " " << q[i];cout << endl;
    vi ans;
    rep(i,n)if(p[i] != q[i])ans.push_back(i+1);
    cout << ans[0] << " " << ans[1] << endl;
}