#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

struct Node{
	int x,y,id; // suffix , all , id
	Node(int X=0,int Y=0,int I=0):x(X),y(Y),id(I){}
	bool operator<(const Node &rhs)const{
		if(x!=rhs.x)return x<rhs.x;
		if(y!=rhs.y)return y<rhs.y;
		return id<rhs.id;
	}
};

void solve(){
	set<Node>S;
	int n=read(),k=read();
	vector<int>a(n+1);
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=k;i++)S.insert(Node(0,0,i));
	for(int i=1;i<=n;i++){
		if(a[i]==1){
			auto [x,y,id]=*S.begin();
			S.erase(S.begin());
			cout<<id<<" ";
			x=max(0,x+a[i]);y=max(y,x);
			S.insert(Node(x,y,id));
		}
		else{
			auto [x,y,id]=*--S.end();
			S.erase(--S.end());
			cout<<id<<" ";
			x=max(0,x+a[i]);y=max(y,x);
			S.insert(Node(x,y,id));
		}
	}
	puts("");
}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
#endif

	int tt=read();while(tt--)solve();

	return 0;
}