#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <string>
using namespace std;
int T, n, m;
int doll, cnt;
bool byIndex(pair<int, int> a, pair<int, int> b)
{
    return a.second < b.second;
}
int main()
{
    freopen("sample_input.txt", "r", stdin);
    cin >> T;
    while (T--)
    {
        scanf("%d %d", &n, &m);
        //인형을 갯수/인덱스 순서로 deque에 저장
        deque<pair<int, int> > dolls;
        vector<int> selected;
        selected.resize(n,0);
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &doll);
            dolls.push_back(make_pair(doll, i));
        }

        //인형을 갯수의 오름차순으로 정렬
        sort(dolls.begin(), dolls.end());
        int remain = m;
        int remain_type = n;
        while (remain >= dolls[0].first*dolls.size())
        {
            int current_quantity = dolls[0].first;
            remain -= current_quantity * dolls.size();
            for (deque<pair<int,int> >::iterator it = dolls.begin(); it != dolls.end(); it++)
            {
                selected[(*it).second] += current_quantity;
                (*it).first -= current_quantity;
            }
            dolls.pop_front();
        }

        //남아있는 인형들을 인덱스의 오름차순으로 정렬
        sort(dolls.begin(), dolls.end(), byIndex);
        deque<pair<int, int> >::iterator iter = dolls.begin();
        while (remain && !dolls.empty())
        {
            selected[(*iter).second]++;
            (*iter).first--;
            iter++;
            if (iter == dolls.end())
                iter = dolls.begin();
            remain--;
        }
        for (vector<int>::iterator it = selected.begin(); it != selected.end(); it++)
        {
            printf("%d ", *it);
        }
        printf("\n");
    }

    return 0;
}