#include <iostream>
#include <vector>
#include <queue>
#include <cassert>
#include <set>

using namespace std;

int main() {
    int n, k, m; cin >> n >> k >> m;
    vector<vector<int>> graph(n+1);
    vector<int> indeg(n+1);
    for (int i = 0; i < m; i++) {
        int a, b; cin >> a >> b;
        graph[a].push_back(b);
        indeg[b]++;
    }
    // vector<queue<int>> next(n+1);
    vector<set<int>> next(n+1);
    for (int i = 1; i <= n; i++) {
        if (indeg[i] == 0) {
            for (int j = 1; j <= k; j++) next[i].insert(j);
        }
    }
    vector<int> ans(n*k);
    for (int i = 0; i < n*k; i++) {
        int x; cin >> x;
        assert(!next[x].empty());
        ans[i] = *next[x].begin();
        // next[x].pop();
        next[x].erase(next[x].begin());
        for (int y : graph[x]) {
            next[y].insert(ans[i]);
        }
    }
    for (int x : ans) cout << x << ' ';
    cout << endl;
}