#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=3e5+5,M=N*4,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-6;const ll INF=1e15+7;mt19937 rnd(263082);
int n,k;ll A[N],l[N],r[N];
struct BIT{
	ll f[N];
	void Cl(){fill(f+1,f+n+2,-INF);}
	void add(int x,ll y){while(x<=n+1) f[x]=max(f[x],y),x+=x&-x;}
	int qry(ll y){int x=0;for(int i=18;~i;i--) if(x+(1<<i)<=n+1&&f[x+(1<<i)]<y) x+=(1<<i);return x+1;}
}f1,f2;
int CK(ll mid){
	l[0]=r[0]=0;int i,j;
	f1.Cl();f2.Cl();f1.add(1,A[0]);f2.add(n+1,A[0]);
	for(i=1;i<=n;i++){
		l[i]=f1.qry(A[i]-mid);r[i]=n+1-f2.qry(A[i]-mid)+1;
		if(l[i]<=n) f1.add(l[i]+1,A[i]),f2.add(n+1-r[i],A[i]);
		// for(j=0;j<i;j++) if(A[i]-mid<=A[j]) l[i]=min(l[i],l[j]+1),r[i]=max(r[i],r[j]+1);
	}
	return l[n]<=k&&k<=r[n];
}
vector<int> I1[N],I2[N];
namespace Tree{
	#define ls v<<1
	#define rs v<<1|1
	ll f[M];void Up(int v){f[v]=max(f[ls],f[rs]);}
	void Cl(){fill(f+1,f+4*(n+1)+1,-INF);}
	void Add(int x,ll y,int l=0,int r=n,int v=1){
		if(l==r) {f[v]=y;return;}int m=l+r>>1;
		x<=m?Add(x,y,l,m,ls):Add(x,y,m+1,r,rs);Up(v);
	}
	int qry(ll z,int l=0,int r=n,int v=1){
		if(f[v]<z) return -1;if(l==r) return l;
		int m=l+r>>1;int p=qry(z,l,m,ls);return ~p?p:qry(z,m+1,r,rs);
	}
}
void build(){
	for(int i=0;i<=n;i++) I1[i].clear(),I2[i].clear();
	for(int i=0;i<=n;i++) if(l[i]<=n) l[i]&&(I1[l[i]-1].emplace_back(i),0),I2[r[i]].emplace_back(i);
	Tree::Cl();
	for(int i=0;i<=n;i++) if(l[i]<=k&&k<=r[i]) Tree::Add(i,A[i]);
}
void find(int x,int y,ll mid){
	if(!x){assert(!y);return;}if(!y) assert(0);
	for(int i:I2[y-1]) Tree::Add(i,A[i]);for(int i:I1[y-1]) Tree::Add(i,-INF);
	int p=Tree::qry(A[x]-mid);assert(p<x);printf("%d%c",x-p," \n"[y==1]);find(p,y-1,mid);
	// for(int i=0;i<x;i++) if(A[x]-A[i]<=mid&&l[i]<=y-1&&y-1<=r[i]) {printf("%d%c",x-i," \n"[y==1]);find(i,y-1,mid);return;}
	// assert(0);
}
void Solve(){
	int i,j;scanf("%d%d",&n,&k);
	for(i=1;i<=n;i++) scanf("%lld",&A[n-i+1]);for(i=1;i<=n;i++) A[i]+=A[i-1];
	ll l=-INF,r=INF,mid;while(l+1<r) mid=l+r>>1,(CK(mid)?r:l)=mid;
	CK(r);build();
	find(n,k,r);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}