#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

const int NMAX = 10005;
const int INF = 1 << 29;

int t, n, p, a[NMAX], dp[NMAX], sol[NMAX];

int main() {
    cin.sync_with_stdio(false);

    freopen("euro.in", "r", stdin);
    freopen("euro.out", "w", stdout);

    scanf("%d", &t);

    for (; t; t--) {
        scanf("%d%d", &n, &p);
        for (int i = 1; i <= n; i++)
            scanf("%d", &a[i]);

        sort(a + 1, a + n + 1);

        for (int i = 1; i <= p; i++) {
            dp[i] = -1;
            sol[i] = INF;
        }

        for (int i = 1; i <= n; i++) {
            for (int j = p; j - a[i] > 0; j--) {
                dp[j] = max(dp[j], dp[j - a[i]]);
                if (dp[j] != -1)
                    sol[j] = min(sol[j], a[i] - dp[j]);
            }

            dp[a[i]] = a[i];
            sol[a[i]] = 0;
        }

        for (int i = 1; i <= p; i++) {
            if (sol[i] == INF)
                sol[i] = -1;
            printf("%d ", sol[i]);
        }

        printf("\n");
    }

    return 0;
}