#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
//#define int long long //instead of int main, use signed main
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef vector<int> vi;
typedef pair<int, int> pii;

signed main(){
    IOS;

    int S, fs, N; cin >> S >> fs >> N;
    
    vector<string> ns(S); for(auto& i : ns) cin >> i;
    sort(ns.begin(), ns.end());
    map<string, int> inv;
    for(int i = 0; i < S; i++) inv[ns[i]] = i;

    map<pii, int> f;
    for(int i = 0; i < fs; i++){
        string u, v; cin >> u >> v;
        int p = inv[u], q = inv[v];
        f[{p, q}] = f[{q, p}] = 1;
    }

    vi ans(N);
    for(int i = 0; i < N; i++){
        string ss; cin >> ss;
        ans[i] = inv[ss];
    }

    vector<int> rank(N);
    vi tmp(N);
    vector<vi> cnt(N + 1, vi(S));
    function<void(int, int)> solve = [&](int L, int R){
        if(L == R) return;
        int mid = (L + R) / 2;
        solve(L, mid);
        solve(mid + 1, R);

        for(int j = 0; j < S; j++) cnt[L][j] = 0;
        for(int i = L; i <= mid; i++){
            cnt[i + 1] = cnt[i];
            cnt[i + 1][ans[i]]++;
        }

        for(int i = mid + 1; i <= R; i++){
            int l = L, r = mid;
            while(l <= r){
                int cur = (l + r) / 2;
                bool chk = true;
                for(int j = 0; j < S; j++){
                    if(cnt[mid + 1][j] - cnt[cur][j] == 0) continue;
                    if(f.find({ans[i], j}) != f.end() && j >= ans[i]) continue;
                    chk = false;
                }
                if(chk) r = cur - 1;
                else l = cur + 1;
            }
            rank[i] = l;
        }

        for(int i = L, j = mid + 1, k = L; i <= mid; i++){
            while(j <= R && rank[j] <= i) tmp[k++] = ans[j++];
            tmp[k++] = ans[i];
            if(i == mid) while(j <= R) tmp[k++] = ans[j++];
        }
        for(int i = L; i <= R; i++) ans[i] = tmp[i];
    };
    solve(0, N - 1);
    for(auto& i : ans) cout << ns[i] << ' ';
    cout << endl;
}