#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int N, K, X;

int main(){
    cin >> N >> K >> X;
    vi D(N), E;
    iota(all(D), 1);
    rep(i, K){
        if(i != X-1){
            int A, B;
            scanf("%d%d", &A, &B);
            swap(D[--A], D[--B]);
        } else{
            char A, B;
            cin >> A >> B;
            E = D;
        }
    }
    vi C(N);
    rep(i, N)scanf("%d", &C[i]);
    //rep(i, N)cout << C[i] << endl;
    //rep(i, N)cout << D[i] << endl;
    int a = 0, b = 0;
    rep(i, N){
        if(C[i] != D[i]){
            a = C[i];
            b = D[i];
            break;
        }
    }
    vi ans;
    rep(i, N){
        if(E[i] == a || E[i] == b){
            ans.push_back(i + 1);
        }
    }
    sort(all(ans));
    cout << ans[0] << ' ' << ans[1] << endl;
}