#include <fstream>
#include <algorithm>

using namespace std;

ifstream cin("progresii.in");
ofstream cout("progresii.out");

const int MAXN = 100000;

long long p[1 + MAXN];

int main() {
    long long n, m, k, l, sum = 0;
    cin >> n >> m >> k >> l;
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
        p[i] = l - p[i];
        sum = sum + p[i] / m;
    }
    k -= n;
    if (sum > k) {
        cout << "-1\n";
        return 0;
    }
    for (int i = 1; i <= n; i++) {
        sum = sum - p[i] / m;
        long long current = p[i] / (k - sum + 1) + 1;
        if (p[i] <= k - sum)
            current = 1;
        k = k - p[i] / current;
        cout << current << "\n";
    }
    return 0;
}