1715B.cpp

#include <bits/stdc++.h>
using namespace std;

int main() {
    int t; cin >> t;
    while (t--) {
        long long n, k, b, s;
        cin >> n >> k >> b >> s;
        
        long long min_required = k * b;
        long long max_possible = k * b + (n - 1) * (k - 1);
        
        if (s < min_required || s > max_possible + (k - 1)) {
            cout << -1 << endl;
            continue;
        }

        vector<long long> ans(n, 0);
        ans[0] = min(s, k * b + k - 1); 
        s -= ans[0];

        for (int i = 1; i < n; ++i) {
            long long take = min(s, k - 1);
            ans[i] = take;
            s -= take;
        }

        if (s > 0) {
            cout << -1 << endl;
        } else {
            for (auto x : ans) cout << x << " ";
            cout << endl;
        }
    }
    return 0;
}