#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i32 = int32_t; using i64 = int64_t; using f64 = double_t; using str = string;
template <typename T> using vec = vector<T>;
template <typename T> using heap = priority_queue<T, vec<T>, greater<T>>;
#define times(n, i) for (i32 i = 0; i < (n); ++i)
#define range(n, m, i) for (i32 i = (n); i < (m); ++i)
#define upto(n, m, i) for (i32 i = (n); i <= (m); ++i)
#define downto(n, m, i) for (i32 i = (n); i >= (m); --i)
#define foreach(xs, x) for (auto &x : (xs))
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) (xs).erase(unique(all(xs)), (xs).end())
#define maximum(xs) (*max_element(all(xs)))
#define minimum(xs) (*min_element(all(xs)))
#define even(x) (((x) & 1) == 0)
#define odd(x) (((x) & 1) == 1)
#define append emplace_back
const i64 MOD = 1000000007;

i32 n, k, x, a[100000], b[100000], c[100000], d[100000];

i32 main()
{
    cin >> n >> k >> x;
    times(k, i) {
        if (i == x-1) {
            char _; cin >> _ >> _;
            a[i] = -1; b[i] = -1;
            continue;
        }
        cin >> a[i] >> b[i]; a[i]--; b[i]--;
    }
    times(n, i) {
        cin >> c[i];
    }
    times(n, i) {
        d[i] = i+1;
    }

    times(x-1, i) {
        swap(d[a[i]], d[b[i]]);
    }
    downto(k-1, x, i) {
        swap(c[a[i]], c[b[i]]);
    }

    vec<i32> v(0);
    times(n, i) {
        if (c[i] != d[i]) {
            v.append(i+1);
        }
    }

    cout << v[0] << " " << v[1] << endl;
    return 0;
}