#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define int long long

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

int A[100010], B[100010];
int state[100010];
int final_state[100010];

signed main()
{ // #define int long long をしてるのでscanfを使うと意味不明な値が入力され死にます
    int N, K, X; cin >> N >> K >> X;

    memset(A, -1, sizeof(A));
    memset(B, -1, sizeof(B));

    rep(i, N) state[i] = i;

    int q = -1;

    rep(i, K) {
        string a, b; cin >> a >> b;

        if (a == "?") {
            q = i;
        } else {
            A[i] = stoi(a) - 1, B[i] = stoi(b) - 1;
        }
    }

    for (int i = 0; i < q; ++i) {
        swap(state[A[i]], state[B[i]]);
    }

    rep(i, N) cin >> final_state[i], final_state[i]--;

    for (int i = K - 1; i > q; --i) {
        swap(final_state[A[i]], final_state[B[i]]);
    }

    vi arr;

    rep(i, N) if (state[i] != final_state[i]) arr.PB(i+1);

    cout << arr[0] << ' ' << arr[1] << endl;
}