#include <bits/stdc++.h>

int n, k, x;
int zss[112345][2];
int xs[112345];
int ys[112345];

int main() {
  scanf("%d %d %d\n", &n, &k, &x);
  for(int i = 0; i < k; ++i) {
    if( i + 1 == x ) {
      char buf[256];
      fgets(buf, sizeof(buf), stdin);
      continue;
    }
    scanf("%d %d\n", &zss[i][0], &zss[i][1]);
  }
  for(int i = 1; i <= n; ++i) {
    scanf("%d", &ys[i]);
  }

  // step 1
  for(int i = 1; i <= n; ++i) {
    xs[i] = i;
  }

  // step 2 : x' <- Ax
  for(int i = 0; i < x; ++i) {
    std::swap(xs[zss[i][0]], xs[zss[i][1]]);
  }

  // step 3 : y' <- B^ty
  for(int i = k - 1; i >= x; --i) {
    std::swap(ys[zss[i][0]], ys[zss[i][1]]);
  }

  // step 4
  std::vector<int> res;
  for(int i = 1; i <= n; ++i) {
    if( xs[i] != ys[i] ) res.push_back(i);
  }
  assert( 2 == (int)res.size() );
  printf("%d %d\n", res[0], res[1]);
  
  return 0;
}