#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 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;
	}
	for(int i=1;i<=n;++i)
	{
		//printf("S=%d v[i]=%d",S,v[i]);
		S-=v[i]/m;
		find_best(i);
		printf("%lld\n",v[i]);
	}	
}
int main()
{
	scan();
	solve();
	return 0;
}