#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
using vi = vector<int>;
const int mn = 5e5+5;

int val[mn], seen[mn], x[mn], indeg[mn];
vi adj[mn], idxs[mn], allow[mn];

int main() {
	int n, k, m; cin >> n >> k >> m;
	for (int i = 0; i < m; i++) {
		int a, b; cin >> a >> b;
		//adj[a].push_back(b);
		//indeg[b]++;
	}
	for (int i = 0; i < n*k; i++) {
		cin >> x[i];
		cout << ++val[x[i]] << ' ';
		//idxs[x[i]].push_back(i);
	}
	cout << endl;
	/*for (int i = 1; i <= n; i++) {
		reverse(idxs[i].begin(), idxs[i].end());
	}
	for (int i = 1; i <= n; i++) {
		if (indeg[i] == 0) {
			for (int j = 0; j < k; j++) {
				val[idxs[i][j]] = k-j;
			}
		}
	}
	for (int i = 0; i < n*k; i++) {
		for (int j : adj[x[i]]) {
			allow
			val[idxs[j].back()] = val[i];
			idxs[j].pop_back();
		}
	}
	for (int i = 0; i < n*k; i++) cout << val[i] << ' ';
	cout << endl;*/
}