#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;
    vector<int> cup(N);
    rep(i,N) cup[i]=i+1;
    bool f=false;
    vector<int> A,B;
    vector<int> c(N);

    rep(i,K){
        char a,b;cin>>a>>b;
        int aa=a-'0';
        int bb=b-'0';
        A.push_back(aa);
        B.push_back(bb);
    }
    rep(i,N){
        cin >> c[i];
    }
//    debug(cup);
//    debug(c);
    for(int i=0;i<X-1;i++){
        int a=A[i];
        int b=B[i];
        swap(cup[a-1],cup[b-1]);
    }
    for(int i=K-1;i>=X;i--){
        int a=A[i];
        int b=B[i];
        swap(c[a-1],c[b-1]);
    }
//    debug(cup);
//    debug(c);
    vi v;
    for(int i=0;i<N;i++){
        if(cup[i]!=c[i]) v.push_back(i+1);
    }
    cout << v[0] << " " << v[1] << endl;
}