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