#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  ll n,k,x;cin >> n >> k >> x;
  vl a,b;
  vl v(n);rep(i,n)v[i]=i;
  rep(i,k){
    string s,t;cin >> s >> t;
    if(i==x-1)continue;
    ll ss=stoll(s),tt=stoll(t);ss--;tt--;
    if(i<x-1)swap(v[ss],v[tt]);
    else{
      a.emplace_back(ss);
      b.emplace_back(tt);
    }
  }
  vl vd(n);
  rep(i,n){
    cin >> vd[i];vd[i]--;
  }
  per(i,a.size()){
    swap(vd[a[i]],vd[b[i]]);
  }
  rep(i,n){
    if(v[i]!=vd[i])cout << i+1 <<" ";
  }
  cout << endl;
}