#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#define REP(i,n) for(int i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
typedef long long int LLI;
typedef unsigned long long int ULLI;
using namespace std;

int main() {
    int n, k, x;
    vector<int> s;
    cin >> n >> k >> x;
    for (int i = 0; i < n; ++i) { s.push_back(i + 1); }
    for (int i = 0; i < x -1; ++i) {
        int a, b; cin >> a >> b;
        swap(s[a - 1], s[b - 1]);
    }
    string _; cin >> _ >> _;
    vector<pair<int, int>> p;
    for (int i = 0; i < k - x; ++i) {
        int a, b; cin >> a >> b;
        pair<int, int> c(a, b);
        p.push_back(c);
    }
    vector<int> e;
    for (int i = 0; i < n; ++i) {
        int a; cin >> a;
        e.push_back(a);
    }
    reverse(ALL(p));
    for (auto i : p) { swap(e[i.first - 1], e[i.second - 1]); }
    int ans[2], c = 0;
    for (int i = 0; i < n; ++i) { if (s[i] != e[i]) { ans[c++] = i + 1;} }
    cout << ans[0] << " " << ans[1] << endl;
    return 0;
}