#include using namespace std; typedef long long ll; #define F first #define S second #define pii pair #define eb emplace_back #define all(v) v.begin(), v.end() #define rep(i, n) for (int i = 0; i < n; ++i) #define rep3(i, l, n) for (int i = l; i < n; ++i) #define chmax(a, b) a = (a >= b ? a : b) #define chmin(a, b) a = (a <= b ? a : b) #define out(a) cout << a << endl #define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl #define SZ(v) (int)v.size() #define inf (int)(1e9+7) #define abs(x) (x >= 0 ? x : -(x)) #define ceil(a, b) a / b + !!(a % b) #define FIX(a) fixed << setprecision(a) int n, k, x; int main() { cin >> n >> k >> x; int a[k], b[k]; rep(i, k) { if (i == x - 1) { char ch; cin >> ch >> ch; continue; } cin >> a[i] >> b[i]; } vector v(n); rep(i, n) v[i] = i + 1; vector vv(n); rep(i, n) cin >> vv[i]; rep(i, x - 1) { swap(v[a[i] - 1], v[b[i] - 1]); } for (int i = k - 1; i >= x; --i) { swap(vv[a[i] - 1], vv[b[i] - 1]); outa(vv, SZ(vv)); } // outa(v, SZ(v)); // outa(vv, SZ(vv)); int flg = 0; rep(i, SZ(v)) { if (v[i] != vv[i]) { if (flg) cout << " "; cout << i + 1; flg = 1; } } cout << endl; }