#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
typedef long long ll;
using namespace std;
const int inf=1e9;

int N,K,X;
int a[100010], b[100010];
int f[100010], c[100010];
int main(){
    cin>>N>>K>>X;
    REP(i,0,K){
        char ca,cb;
        cin>>ca>>cb;
        a[i]=ca-'1'; b[i]=cb-'1';
    }
    X--;
    REP(i,0,N) cin>>c[i];
    REP(i,0,N){
        f[i]=i+1;
    }
    REP(i,0,X){
        swap(f[a[i]],f[b[i]]);
    }
    RREP(i,X+1,K){
        swap(c[a[i]],c[b[i]]);
    }
    vector<int> vt;
    REP(i,0,N){
        if(f[i]!=c[i]) vt.push_back(i+1);
    }
    p2(vt[0],vt[1]);
}