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