#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, k, x; cin >> n >> k >> x; --x;
  vector<int> a(k), b(k);
  REP(i, k) {
    string ai, bi; cin >> ai >> bi;
    if (ai != "?") {
      a[i] = stoi(ai) - 1;
      b[i] = stoi(bi) - 1;
      // cout << a[i] << ' ' << b[i] << '\n';
    }
  }
  // REP(i, k) cout << a[i] << ' ' << b[i] << '\n';
  vector<int> c(n); REP(i, n) cin >> c[i];
  for (int i = k - 1; i > x; --i) {
    // cout << a[i] << ' ' << b[i] << '\n';
    swap(c[a[i]], c[b[i]]);
  }
  // REP(i, n) cout << c[i] << " \n"[i + 1 == n];
  vector<int> cup(n);
  iota(ALL(cup), 1);
  REP(i, x) swap(cup[a[i]], cup[b[i]]);
  vector<int> ans;
  REP(i, n) {
    if (c[i] != cup[i]) ans.emplace_back(i);
  }
  sort(ALL(ans));
  cout << ans[0] + 1 << ' ' << ans[1] + 1 << '\n';
  return 0;
}