#include<bits/stdc++.h>
#define int long long
#define matsuri pair<int,int>
//const int iris = 1e9+7;
const int iris = 998244353;
using namespace std;

void solve()
{
	int n,m,k;
	cin>>n>>m>>k;
	vector<int> arr(n+1);
	vector<vector<int> > G(n+1);
	for(int i=1;i<=n;i++)
		cin>>arr[i], arr[i]--;
	while(m--)
	{
		int a,b;
		cin>>a>>b;
		G[a].emplace_back(b);
		G[b].emplace_back(a);
	}
	priority_queue<matsuri, vector<matsuri>, greater<matsuri> > pq;
	vector<int> la(n+1);
	vector<vector<int> > sagiri(n+1);
	for(int i=1;i<=n;i++)
	{
		la[i]=i;
		sagiri[i].emplace_back(i);
		pq.emplace(1, i);
	}
	while(pq.size()>=2)
	{
		auto [_, x]=pq.top();
		pq.pop();
		if(_!=sagiri[x].size())
			continue;
		auto &v=sagiri[x];
		int nene=1e9, y=0;
		for(int a:v)
		{
			for(int b:G[a])
			{
				if(la[b]==la[a])
					continue;
				int aoi=(arr[b]-arr[a]+k)%k;
				if(aoi<nene)
					nene=aoi, y=la[b];
			}
		}
		for(int a:v)
		{
			arr[a]=(arr[a]+nene-1+k)%k;
			la[a]=y;
			sagiri[y].emplace_back(a);
		}
		pq.emplace(sagiri[y].size(), y);
	}
	for(int i=1;i<=n;i++)
		cout<<arr[i]+1<<" \n"[i==n];
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int T=1;
	//cin>>T;
	while(T--)
		solve();

	return 0;
}