#include <stdio.h>
#define Nmax 100001
long long v[Nmax];
int n,m;
long long k,l;
long long S;
void scan()
{
	freopen("progresii.in", "r", stdin);
	freopen("progresii.out", "w",stdout);
	scanf("%d%d%lld%lld", &n,&m,&k,&l);
	for(int i=1;i<=n;++i)
	{
		scanf("%lld", &v[i]);
		v[i]=l-v[i]+1;
		S+=v[i]/m;
	}
}
void cauta_x(int p, int u, int x)
{
	int m;
	m=(p+u)/2;
	while (p<=u)
	{
		//printf("%d ",m);
		if(m==1 ||  ( (m!=0 && (k-v[x]/m+S)>=0 ) && (k-v[x]/(m-1)+S)<0 ) )
		{
			k-=(v[x]/m);
			v[x]=m;
			return;
		}	
		else 
			if ( k-(v[x]/m+S)<0)
			{
				p=m+1; 
				m=(p+u)/2; 
			}
			else 
			{ 
				u=m-1; 
				m=(p+u)/2; 
			} 
	}
}
/*void find_best(int ii)
{
	//printf(" k=%d ",k);
	for(int i=1;i<=m;++i)
		if(k-(v[ii]/i+S)>=0)
		{
			k-=v[ii]/i;
			v[ii]=i;
			return;
		}	
}*/	
void solve()
{
	if(S>k)
	{
		printf("-1\n");
		return;
	}
	//cauta_x(1,m,1);
	for(int i=1;i<=n;++i)
	{
		S-=v[i]/m;
		cauta_x(1,m,i);
		//find_best(i);
		printf("%lld\n",v[i]);
	}	
}
int main()
{
	scan();
	solve();
	return 0;
}