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