#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...)    69
#define debugArr(...)  69
#endif
using namespace std;

typedef long long     ll;
typedef pair<int,int> pii;
typedef pair<ll,ll>   pll;

const int N =5e5 + 23;
const ll inf = 1e18;

#define F           first
#define S           second
#define pb          push_back
#define kill(x)     cout<<x<<endl, exit(0);
#define all(x)      x.begin(),x.end()
#define sz(x)       (int)x.size()
#define lc          (v << 1)
#define rc          ((v<<1) |1)

int n,k;
int val[N];
int a[N];
set<pii> st;

void solve() {
	cin>>n>>k;
	for(int i = 1; i<= n ; i++) {
		cin>>a[i];
	}
	st.clear();
	for(int i = 1;i <= k; i++) {
		st.insert({0,i});
	}
	for(int i =1; i<= n ;i ++) {
		debug(st);	
		if(a[i] == 1) {
			int x = st.begin()->F;
			int id= st.begin()->S;
			st.erase(*st.begin());
			val[i] = id;
			x++;
			st.insert({x,id});
		} else {
			int x=  st.begin()->F;
			int id = st.begin()->S;
			st.erase(*st.rbegin());
			val[i] = id;
			x = max(x-1,0);
			st.insert({x,id});
		}
		cout<<val[i] << ' ';
	}
	cout<<'\n';
}

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(false);
	int testcase= 1;
	cin>>testcase;
	for(int tcase = 1; tcase <= testcase; tcase ++) {
		#ifdef LOCAL
			cout<<"\n------------------\n" << "Test case: " <<  tcase<< endl;
		#endif
		solve();
		#ifdef LOCAL
			cout<<endl;
		#endif
	}
    return 0;
}

// Jumpsuit, Jumpsuit cover me!
// Jumpsuit, Jumpsuit cover me!