#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define ALL(x) (x).begin(), (x).end() #define BIT(n) (1LL<<(n)) #define SZ(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair;using vb=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; void Main() { int N, K, X; cin >> N >> K >> X; vpii F, B; rep(i, X-1) { int l, r; cin >> l >> r; l--; r--; F.emplace_back(l, r); } { string q1, q2; cin >> q1 >> q2; } rep(i, K-X) { int l, r; cin >> l >> r; l--; r--; B.emplace_back(l, r); } reverse(ALL(B)); vi R(N); rep(i, N) cin >> R[i]; vi I(N); rep(i, N) I[i] = i+1; forr(lr, F) { swap(I[lr.fst], I[lr.snd]); } forr(lr, B) { swap(R[lr.fst], R[lr.snd]); } //cout << "I:"; rep(ii,SZ(I)) cout << ' ' << I[ii]; cout << endl; //cout << "R:"; rep(ii,SZ(R)) cout << ' ' << R[ii]; cout << endl; vi ans; rep(i, N) { if (I[i] != R[i]) ans.push_back(i); } assert(SZ(ans) == 2); _p("%d %d\n", ans[0]+1, ans[1]+1); } int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }