#include<bits/stdc++.h>
using namespace std;
class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};
InParser f("progresii.in");
ofstream g("progresii.out");
long long n,m,k,l,b,e;
long long v[100002];
long long srm[100002];
int sol[100002];
int main()
{
    f>>n>>m>>k>>l;
    for(int i=1;i<=n;++i)
        f>>v[i];
    for(int i=n;i>=1;--i)
    {
        srm[i]=srm[i+1];
        srm[i]+=((l-v[i])/m+1);
    }
    if(k<srm[1]){
        g<<-1;
        return 0;
    }
    for(int i=1;i<=n;++i)
    {
        b=1;
        e=m;
        while(b<=e)
        {
            long long mj=(b+e)/2;
            long long q=(l-v[i])/mj+1;
            if(mj==1){
                sol[i]=1;
                k=k-q;
                break;
            }
            long long q1=(l-v[i])/(mj-1)+1;
            if((k-q>=srm[i+1] && k-q1<srm[i+1]))
            {
                sol[i]=mj;
                k=k-q;
                break;
            }
            else
                if(k-q<srm[i+1])
                    b=mj+1;
                else
                    e=mj-1;
        }
    }
    for(int i=1;i<=n;++i)
        g<<sol[i]<<'\n';
    return 0;
}