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

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

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

    // input
    ll N, K, X;
    cin >> N >> K >> X;

    vector<ll> A(N);
    FOR(i, 0, N){
        A[i] = i;
    }

    FOR(i, 0, X-1){
        ll a, b;
        cin >> a >> b;
        a--;
        b--;
        swap(A[a], A[b]);
    }

    char c;
    cin >> c;
    cin >> c;

    vector<ll> Y(K-X);
    vector<ll> Z(K-X);
    FOR(i, 0, K-X){
        cin >> Y[i] >> Z[i];
        Y[i]--;
        Z[i]--;
    }

    vector<ll> C(N);
    FOR(i, 0, N){
        cin >> C[i];
        C[i]--;
    }

    // swap inversely
    for(int i=K-X-1; i>=0; i--){
        ll y = Y[i];
        ll z = Z[i];
        swap(C[y], C[z]);
    }

    vector<ll> ans;

    FOR(i, 0, N){
        if(A[i]!=C[i]) ans.push_back(i);
    }

    cout << ans[0]+1 << " " << ans[1]+1 << endl;
    
    return 0;
}