#include <fstream>

using namespace std;

int n, m, k, l;
int d[100002], v[100002];
int tot;

int main()
{
	ifstream fin("progresii.in");
	ofstream fout("progresii.out");

	fin >> n >> m >> k >> l;
	for (int i = 1; i <= n; ++i)
	{
		fin >> d[i];
		d[i] *= -1, d[i] += l;

		tot += d[i] + 1;
		v[i] = 1;
	}

	int step;
	for (step = 1; (step << 1) <= m; step <<= 1);

	for (int i = n; i >= 1 && tot > k; --i)
	{
		int stepx = step, valm, res, many, hnow = d[i];

		for (valm = 0; stepx; stepx >>= 1)
            if (valm + stepx <= m && tot - d[i] + (d[i] / (valm + stepx)) - k >= 0)
                valm += stepx;
        if (valm + 1 <= m && tot - d[i] + d[i] / valm  - k > 0 && tot - d[i] + d[i] / (valm + 1) - k <= 0) ++valm;

        many = d[i] / valm;
        res = d[i] / (many + 1) + 1;

        tot -= d[i];
        tot += d[i] / res;
        v[i] = res;
	}
	if (tot > k) fout << -1 << '\n';
	else
		for (int i = 1; i <= n; ++i)
			fout << v[i] << '\n';

	fin.close();
	fout.close();
}