#include <bits/stdc++.h>

using namespace std;
#define int long long int
#define pb push_back
#define sz(x) (int)(x.size())
#define all(a) a.begin(), a.end()
#define nl '\n'
const int N = 4005, GMAX = 8005, INF = 1e16, mod = 998244353;

int n, vmax, v[N];

void run_case(int test_case) {
    cin >> n >> vmax;
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    sort(v + 1, v + n + 1, greater<int>());
    vector<vector<int>> last(2, vector<int>(vmax + 1, INF));
    vector<int> ans(vmax + 1, INF);
    last[0][v[1]] = v[1];
    ans[v[1]] = 0;
    for (int i = 2; i <= n; i++) {
        last[1][v[i]] = v[i]; /// lot cu un singur jucator automat are aroganta minima adica 0.
        for (int g = 1; g <= vmax; g++) {
            last[1][g] = min(last[1][g], last[0][g]);
            if (g - v[i] > 0) {
                last[1][g] = min(last[1][g], last[0][g - v[i]]);
            }
        }
        for (int g = 1; g <= vmax; g++) {
            last[0][g] = last[1][g];
            last[1][g] = INF;
            if (last[0][g] != INF)
                ans[g] = min(ans[g], last[0][g] - v[i]);
        }
    }
    for (int g = 1; g <= vmax; g++) {
        if (ans[g] == INF)
            cout << -1 << ' ';
        else
            cout << ans[g] << ' ';
    }
    cout << '\n';
};

signed main() {
    freopen("euro.in", "r", stdin);
    freopen("euro.out", "w", stdout);
    int T = 1;
    cin >> T;
    for (int t = 1; t <= T; ++t) {
#ifdef _DEBUG
        cerr << "=== Subtask " << t << " ===" << '\n';
#endif
        run_case(t);
#ifdef _DEBUG
        cerr << nl;
#endif
    }
}