#include <stdio.h>
#include <stdlib.h>

#define MAX_T 50
#define MAX_N 100000

struct dolls_item
{      
    int idx;
    int num;
};

int n[MAX_T];
int solve[MAX_T][MAX_N];

int qsort_dolls_item(const void *arg1, const void *arg2)
{
    return ((struct dolls_item *)arg1)->num >= ((struct dolls_item *)arg2)->num;
}

void solve_dolls(int *solve, int *dolls, int n, int m)
{
    int i, j;

    struct dolls_item dolls_item[MAX_N];    

    for (i = 0; i < n; i++)
    {
        dolls_item[i].idx = i;
        dolls_item[i].num = dolls[i];
    }

    qsort(dolls_item, n, sizeof(struct dolls_item), qsort_dolls_item);

    for (i = 0; i < n; i++)
    {
        int min = dolls_item[i].num;

        if (min * (n - i) <= m)
        {
            for (j = i; j < n; j++)
            {
                dolls_item[j].num -= min;
                solve[dolls_item[j].idx] += min;
                m -= min;
            }
        }
        else
        {
            for (j = i; j < n; j++)
            {
                dolls_item[j].num -= (m / (n - i));
                solve[dolls_item[j].idx] += (m / (n - i));
                m -= (m / (n - i));
            }

            for (j = i; j < m; j++)
            {
                dolls_item[j].num--;
                solve[dolls_item[j].idx]++;
                m--;
            }
        }
    }
}

int main(int argc, char *argv[])
{
    int T;
    int i, j;

    scanf("%d", &T);

    for (i = 0; i < T; i++)
    {
        int m;
        int dolls[MAX_N];

        scanf("%d %d", &n[i], &m);

        for (j = 0; j < n[i]; j++)
            scanf("%d", &dolls[j]);

        solve_dolls((int *)&solve[i], (int *)&dolls, n[i], m);
    }

    for (i = 0; i < T; i++)
    {
        for (j = 0; j < n[i]; j++)
        {
            if (j + 1 < n[i])
                printf("%d ", solve[i][j]);
            else
                printf("%d\n", solve[i][j]);
        }
    }       

    return 0;
}