#include <fstream>
 
 
using namespace std;
 
ifstream fin("progresii.in");
ofstream fout("progresii.out");
 
int n, m;
long long k, l, d[100002], v[100002], tot;
 
int main()
{
 
 
    fin >> n >> m >> k >> l;
    for (int i = 1; i <= n; ++i)
    {
        fin >> d[i];
        d[i] *= -1, d[i] += l;
 
        tot += d[i] / m;
        v[i] = m;
    }
    k -= n;
 
    for (int i = 1; i <= n ; ++i)
    {
        long long can = k - tot + d[i] / m, val;
        if (can < 0) break;
 
        if (d[i] <= can) val = 1;
        else val = d[i] / (can + 1) + 1;
 
        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();
}