/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
int n,K;
int a[200005],b[200005];
int maxlen[200005],now[200005];
vector <int> v1,v2;
void solve()
{
	cin>>n>>K;
	for(int i=1;i<=n;i++) cin>>a[i];
	v1.clear(),v2.clear();
	for(int i=1;i<=K;i++) maxlen[i]=0,now[i]=0,v1.pb(i),v2.pb(i);
	for(int i=1,v=1;i<=n;i++)
	{
		if(a[i]==1)
		{
			int flg=0;
			while(v1.size())
			{
				int u=v1.back();
				if(now[u]<maxlen[u]) 
				{
					flg=1;
					now[u]++,b[i]=u,v2.pb(u);
					break;
				}
				else v1.pop_back();
			}
			if(flg) continue;
			b[i]=v,maxlen[v]++,now[v]++,v1.pb(v),v2.pb(v);
			v++;
			if(v==K+1) v=1;
		}
		else
		{
			int flg=0;
			while(v2.size())
			{
				int u=v2.back();
				if(now[u])
				{
					flg=1;
					now[u]--,b[i]=u,v1.pb(u);
					break;
				}
				else v2.pop_back();
			}
			if(flg) continue;
			b[i]=1;
		}
	}
	for(int i=1;i<=n;i++) cout<<b[i]<<" ";
	cout<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
	cin>>_;
	while(_--) solve();
	return 0;
}