#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define fi first
#define se second

#define INF 2147483600

int main(){
  int n,k,x;
  scanf("%d %d %d\n", &n, &k, &x);
  vector<int> f(n),g(n);
  vector<int> a(k),b(k);

  rep(i,k){
    if(i==x-1) scanf("%c %c\n", &a[i], &b[i]);
    else scanf("%d %d\n", &a[i], &b[i]);
  }
  rep(i,n) scanf("%d", &g[i]);

  rep(i,n) f[i]=i+1;
  rep(i,x-1){
    swap(f[a[i]-1], f[b[i]-1]);
  }

  for(int i=k-1; i>=x; i--){
    swap(g[a[i]-1], g[b[i]-1]);
  }

  bool flg=false;
  rep(i,n) if(f[i]!=g[i]){
    cout<<i+1;
    if(flg) cout<<endl;
    else cout<<" ", flg=true;
  }


  return 0;
}