#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int main(){
  ios::sync_with_stdio(false);
  int N, K, X;
  cin >> N >> K >> X;
  vector< pair<int,int> > v;
  rep(i,K){
    string sa, sb;
    cin >> sa >> sb;
    if(sa == "?"){
      v.push_back(make_pair(-1,-1));
    }else{
      int a, b;
      {
        stringstream ss(sa);
        ss >> a;
      }
      {
        stringstream ss(sb);
        ss >> b;
      }
      a--;
      b--;
      v.push_back(make_pair(a,b));
    }
  }
  vector<int> first, last;
  rep(i,N){
    int c;
    cin >> c;
    first.push_back(i+1);
    last.push_back(c);
  }

  rep(i,v.size()){
    if(v[i].first == -1) break;
    swap(first[v[i].first], first[v[i].second]);
  }
  for(int i=v.size()-1; i>=0; i--){
    if(v[i].first == -1) break;
    swap(last[v[i].first], last[v[i].second]);
  }

  vector<int> ret;
  rep(i,N){
    if(first[i] != last[i]){
      ret.push_back(i+1);
      //break;
    }
  }
  
  cout << ret[0] << " " << ret[1] << endl;
  return 0;
}