#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;

int main(){
  int N, K, X;
  cin >> N >> K >> X;

  vector<int> A, B;
  for(int i=1;i<=K;i++){
    if (i == X) {
      char dummy;
      cin >> dummy >> dummy;
      A.push_back(-1); B.push_back(-1);
    } else {
      int a, b;
      cin >> a >> b;
      --a; --b;
      A.push_back(a); B.push_back(b);
    }
  }

  vector<int> S(N), C(N);
  for(int i=0;i<N;i++)S[i] = i + 1;
  for(int i=0;i<N;i++)cin >> C[i];

  for(int i=1;i<X;i++){
    swap(S[A[i-1]], S[B[i-1]]);
  }
  for(int i=K;i>X;i--){
    swap(C[A[i-1]], C[B[i-1]]);
  }

  for(int i=0;i<N;i++)if(S[i] != C[i]){
    cout << i + 1 << " ";
  }
  cout << endl;

  return 0;
}