#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    int N,K,X;
    cin >> N >> K >> X;    
    int A[100000] = {0};
    int B[100000] = {0};
    for ( int i = 0; i < N; i++ ) {
        A[i] = i+1;
    }
    int a,b;
    char c;
    for ( int i = 0; i < K; i++ ) {
        if ( i != X-1 ) {
            cin >> a >> b;
            a--; b--;
            swap( A[a], A[b] );
        }
        else {
            cin >> c >> c;
            memcpy( B, A, sizeof(A) );
        }        
    }
    int x;
    for ( int i = 0; i < N; i++ ) {
        cin >> x;
        if ( A[i] != x ) {
            a = A[i]; b = x;
        }
    }
    int ans[2];
    x = 0;
    for ( int i = 0; i < N; i++ ) {
        if ( B[i] == a || B[i] == b ) {
            ans[x] = i+1;
            x++;
        }
    }    
    cout << ans[0] << " " << ans[1] << endl;
 
    return 0;
}