#include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
#define rep(i, a, b) for (auto cc##i = (b), i = (a); i <= cc##i; ++i)
#define debug(...) fprintf(stderr, __VA_ARGS__)

using LL = long long;
using PLI = std::pair<LL, int>;
const int N = 5e5 + 5;
const LL Inf = 1e18;

int fa[N];
int find(int u) {
	while (u != fa[u]) u = fa[u] = fa[fa[u]];
	return u;
}
void merge(int u, int v) {u = find(u), v = find(v), fa[u] = v;}

int n, m, K, c[N];
std::vector<int> G[N], vec[N];
int norm(int x) {return (x % K + K) % K;}
bool near(int x, int y) {return norm(x - y) == 1 || norm(x - y) == K - 1;}

LL dis[N], vis[N], mx;
void Dijkstra() {
	std::priority_queue<PLI, std::vector<PLI>, std::greater<PLI>> q;
	rep(i, 1, n) dis[i] = Inf;
	int s = find(1);
	dis[s] = 0, q.push({0, s});
	while (!q.empty()) {
		int u = q.top().second; q.pop();
		if (vis[u]) continue;
		vis[u] = 1, mx = std::max(mx, dis[u]);
		for (auto x : vec[u]) {
			for (auto y : G[x]) {
				int fy = find(y);
				if (fy == u || vis[fy]) continue;
				if (dis[fy] > dis[u] + norm(c[y] - c[x] - 1)) {
					dis[fy] = dis[u] + norm(c[y] - c[x] - 1);
					q.push({dis[fy], fy});
				}
			}
		}
	}
}
int main() {
	scanf("%d%d%d", &n, &m, &K);
	rep(i, 1, n) scanf("%d", &c[i]), fa[i] = i, c[i]--;
	rep(i, 1, m) {
		int u, v;
		scanf("%d%d", &u, &v);
		G[u].push_back(v);
		G[v].push_back(u);
		if (near(c[u], c[v])) merge(u, v);
	}
	rep(u, 1, n) vec[find(u)].push_back(u);
	Dijkstra();
	rep(i, 1, n) (c[i] += (mx - dis[find(i)]) % K + 1) %= K;
	rep(i, 1, n) printf("%d ", ++c[i]);
	printf("\n");
	return 0;
}