// LUOGU_RID: 150734362
#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
#define eb emplace_back
#define all(x) x.begin(),x.end()
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>;
const int N=4e5+5,M=2e5+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,k,A[N],B[N];
int CK(int mid){
	int pt=0;
	for(int i=1;i<=n;i++){
		if(A[i]==1){
			pt++;B[i]=(pt+mid-1)/mid;
			if(pt>1ll*mid*k) return 0;
		}else{
			B[i]=max((pt+mid-1)/mid,1);pt--;if(pt<0) pt=0;
		}
	}
	return 1;
}
void Solve(){
	int i,j;scanf("%d%d",&n,&k);
	for(i=1;i<=n;i++) scanf("%d",&A[i]);
	int l=0,r=n+2,mid;while(l+1<r) mid=l+r>>1,(CK(mid)?r:l)=mid;
	gdb(r);CK(r);for(i=1;i<=n;i++) printf("%d%c",B[i]," \n"[i==n]);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}