#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 += 1 + d[i] / m;
		v[i] = m;
	}

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

	for (int i = 1; i <= n ; ++i)
	{
		int val, stepx = step;
		for (val = m + 1; stepx; stepx >>= 1)
            if (val - stepx >= 1 && tot - d[i] / m + d[i] / (val - stepx) <= k)
                val -= stepx;
        if (val == m + 1) continue;

        tot -= d[i] / m, tot += d[i] / val;
        v[i] = val;
	}

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

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