#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,k,x;
    cin>>n>>k>>x;
    vector<int> a(k),b(k);
    x--;
    for(int i = 0;i<k;i++){
        if(i==x){
            char c;
            cin>>c>>c;
            a[i] = b[i] = -1;
            continue;
        }
        cin>>a[i]>>b[i];
        a[i]--;b[i]--;
    }
    vector<int> now(n,0);
    for(int i = 0;i<n;i++) now[i] = i;
    for(int i = 0;i<x;i++){
        swap(now[a[i]],now[b[i]]);
    }
    vector<int> c(n);
    for(int i = 0;i<n;i++){
        cin>>c[i];
        c[i]--;
    }
    for(int i = k-1;i>x;i--){
        swap(c[a[i]],c[b[i]]);
    }
    int ni = -1,nj = -1;
    for(int i = 0;i<n;i++) if(now[i]!=c[i]){
        if(ni==-1) ni = i;
        else nj = i;
    } 
    cout<<ni+1<<" "<<nj+1<<endl;
}