#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
#define CININIT cin.tie(0),ios::sync_with_stdio(false)
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

int main(){
    int N,K,X;
    cin>>N>>K>>X;
    X--;
    vector<int> cup(N);
    rep(i,N) cup[i]=i;
    bool f=false;
    vector<int> A,B;

    rep(i,K){
        char a,b;cin>>a>>b;
        if(i<X){
            a -= '0';
            b -= '0';
            a--;
            b--;
            int aa=a;
            int bb=b;
            swap(cup[aa],cup[bb]);
        }else if(i==X){
            continue;
        }else{
            a-='0';
            b-='0';
            A.push_back(a-1);
            B.push_back(b-1);
        }
    }


    vector<int> c(N);
    rep(i,N){
        cin>>c[i];
    }

    rep(i,N) c[i]--;
    for(int i=A.size()-1;i>=0;i--){
        swap(c[A[i]],c[B[i]]);
    }
    vi v;
    rep(i,N){
        if(cup[i]!=c[i]){
            v.push_back(i+1);
        }
    }
    if(v.size()!=2){
        while(true) {}
    }
    cout << v[0] << " " << v[1] << endl;
}