#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************

// 4 3
// 1 7 6 8
// 1 7 2
// 2 9 5


vector<int> locations;
vector<int> movedFrom;
vector<int> movedTo;

vector<int> consistency(int n, int m){

	set<int> st;
	for(int i=0; i<n; i++) st.insert(locations[i]);
	
	for(int i=0; i<m; i++){
		int x = movedFrom[i];
		int y = movedTo[i];
		
		st.erase(x);
		st.insert(y);
	}
	
	vector<int> ans;
	for(auto& t : st){
		ans.push_back(t);
	}

	return ans;
}















vector<int> practice(int n, int m){

	return {};
}





void solve() {
    
    int n, m;
    cin>> n >> m;
    
    locations.resize(n);
    for(int i=0; i<n; i++) cin >> locations[i];
    
    movedFrom.resize(m);
    movedTo.resize(m);
    for(int i=0; i<m; i++) cin >> movedFrom[i];
    for(int i=0; i<m; i++) cin >> movedTo[i];
    
    auto ans = consistency(n, m);
	
	for(auto& t : ans) cout << t << " "; cout << endl;

}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}