#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main()
{
    int n, k, x;
    char c;
    cin >> n >> k >> x;
    vector<int> a(n), ans(n);
    vector<vector<int>> ab(k, vector<int>(2));
    for (int i = 0; i < n; i++) a[i] = i+1;
    for (int i = 0; i < k; i++) {
        if (i == x-1) {
            cin >> c >> c;
            continue;
        };
        cin >> ab[i][0];
        cin >> ab[i][1];
    }
    for (int i = 0; i < n; i++) cin >> ans[i];
    for (int i = 0; i < x-1; i++){
        int p, q;
        p = ab[i][0];
        q = ab[i][1];
        p--;
        q--;
        swap(a[p], a[q]);
    }
    for (int i = k-1; i >= x; i--){
        int p, q;
        p = ab[i][0];
        q = ab[i][1];
        p--;
        q--;
        swap(ans[p], ans[q]);
    }
    for (int i = 0; i < n; i++){
        if (a[i] != ans[i]) cout << i+1 << " ";
    }
    cout << endl;
}