#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
bool be;
constexpr int N = 3e3 + 5;
int n, m, k, a[N], b[N], dp[N][N];
bool f[N][N];
bool dfs(int u, int r)
{
	if (r > k) return 0;
	if (dp[u][r] != -1) return dp[u][r];
	for (int i = 1; i <= n; ++i) {
		if (a[i] == b[r] && f[u][i]) {
			if (!dfs(i, r + 1)) {
				return dp[u][r] = 1;
			}
		}
	}
	return dp[u][r] = 0;
}
bool en;
int main()
{
#ifdef IAKIOI
	cerr << (&be - &en) / 1024.0 / 1024 << " MB\n----------------------------" << endl;
	freopen("in.in", "r", stdin);
	// freopen("out.out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m >> k;
	for (int i = 1; i <= n; ++i) cin >> a[i];
	for (int i = 1; i <= k; ++i) cin >> b[i];
	for (int i = 1; i <= m; ++i) {
		int u, v;
		cin >> u >> v;
		f[u][v] = 1;
	}
	for (int k = 1; k <= n; ++k) {
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= n; ++j) {
				f[i][j] |= f[i][k] & f[k][j];
			}
		}
	}
	memset(dp, -1, sizeof dp);
	for (int i = 1; i <= n; ++i) {
		int ans = -1;
		for (int j = 0; j < k; ++j) {
			if (dfs(i, j + 1)) {
				ans = j;
				break;
			}
		}
		cout << ans << ' ';
	}
	return 0;
}