// // 429.cpp // yukicoder // // Created by KITAZUMI on 2016/11/08. // Copyright © 2016年 KITAZUMI. All rights reserved. // #include #include #include #include #include using namespace std; int main(){ int N, K, X; int A[100000]; int B[100000]; int C[100000]; int S[100000]; int tmp; string c; int ans1, ans2; int flag = 0; char a,b; int j; cin >> N >> K >> X; ans1 = 0; ans2 = 0; for(int i = 0; i < K; i++){ if(i == X-1){ cin >> a >> b; }else{ cin >> A[i] >> B[i]; } } cin.ignore(); getline(cin, c); stringstream ss(c); while(getline(ss, c, ' ')){ C[j] = atoi(c.c_str()); j++; } for(int i = 0; i < N; i++){ S[i] = i+1; } for(int i = 0; i < X-1; i++){ tmp = S[A[i]-1]; S[A[i]-1] = S[B[i]-1]; S[B[i]-1] = tmp; } for(int i = K-1; i > X-1; i--) { tmp = C[A[i]-1]; C[A[i]-1] = C[B[i]-1]; C[B[i]-1] = tmp; } for(int i = 0; i < N; i++){ if(S[i] != C[i] && flag == 0){ ans1 = i+1; flag = 1; } else if(S[i] != C[i] && flag == 1){ ans2 = i+1; break; } else{ continue; } } cout << ans1 << " " << ans2 << endl; return 0; }