#include <stdio.h>
#define Nmax 100001
int 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("%d", &v[i]);
		v[i]=l-v[i]+1;
		S+=v[i]/m;
	}
}
inline int max(int x,int y)
{
	if(x>y)
		return x;
	return y;
}	
inline int min(int x,int y)
{
	if(x<y)
		return x;
	return y;
}
void solve()
{
	if(S>k)
	{
		printf("-1\n");
		return;
	}
	long long minv,kk;
	for(int i=1;i<=n;++i)
	{
		S-=v[i]/m;
		(long long)(kk=k-S);
		(long long)(minv=max(kk,v[i])/min(v[i],kk) );
		k-=v[i]/minv;
		printf("%d\n",minv);
	}	
}
int main()
{
	scan();
	solve();
	return 0;
}