#include<stdio.h>
long long n,m,k,l,s,v[100010],ram;
long long p[100010];
int caut(int x)
{
	int p=1,q=m,mij,aux;
	while(p<q)
	{
		mij=(p+q)>>1;
		aux=v[x]/mij;
		if(aux<=ram)
			q=mij;
		else
			p=mij+1;
	}
	return p;
}
int main()
{
	freopen("progresii.in","r",stdin);
	freopen("progresii.out","w",stdout);
	scanf("%lld%lld%lld%lld",&n,&m,&k,&l);
	long long i,aux,aux1;
	s=n;
	for(i=1; i<=n; i++)
	{
		scanf("%lld",&v[i]);
		v[i]=l-v[i];
		if(v[i]>0)
		{
			aux=v[i]/m;
			p[i]=aux;
			s+=aux;
		}
	}
	ram=k-s;
	if(ram<0)
	{
		printf("-1\n");
		return 0;
	}
	for(i=1; i<=n; i++)
	{
		ram+=p[i];
		aux=caut(i);
		if(aux<m)
		{
			aux1=v[i]/aux;
			/*while(aux1>ram)
			{
				aux++;
				aux1=v[i]/aux;
			}*/
			printf("%lld\n",aux);
			ram-=aux1;
		}
		else
		{
			ram-=p[i];
			printf("%lld\n",m);
		}
		
	}
	return 0;
}