#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, k, x;
    cin >> n >> k >> x;
    int f[n+1] = {};
    rep(i,n+1)f[i] = i;
    rep(i,k){
        if(i == x - 1){
            char s,t;
            cin >> s >> t;
            continue;
        }
        int a,b;
        cin >> a >> b;
        swap(f[a], f[b]);
    }
    srep(i,1,n+1){
        int c;
        cin >> c;
        if(c != f[i]){
            cout << i << ' ';
        }
    }
    cout << endl;
    return 0;
}