#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
#define endl '\n'
const LL maxn = 4e05+7;
const LL N = 5e05+10;
const LL mod = 1e09+7;
const int inf = 0x3f3f3f3f;
const LL llinf = 5e18;
typedef pair<int,int>pl;
LL gcd(LL a, LL b){
	return b > 0 ? gcd(b , a % b) : a;
}

LL lcm(LL a , LL b){
	return a / gcd(a , b) * b;
}
int n , m;
vector<int>a(N , 0);
void init(int n){
	for(int i = 0 ; i <= n ; i ++){
		a[i] = 0;
	}
}
void solve() 
{
	cin >> n >> m;
	int cnt = 0;
	for(int i = 0 ; i < n ; i ++){
		cin >> a[i];
		cnt += a[i];
		cnt = max(0 , cnt);
	}
	int tot = (cnt - 1) / m + 1;
	vector<int>ans(n , 0);
	set<pair<int,int>>st;
	for(int i = 0 ; i < m ; i ++){
		st.insert({0 , i + 1});
	}
	for(int i = 0 ; i < n ; i ++){
		if(a[i] == 1){
			auto it = st.begin();
			st.erase(it);
			pair<int,int>tmp = *it;
			tmp.x++;
			ans[i] = tmp.y;
			st.insert(tmp);
		}
		else{
			auto it = st.end();
			it--;
			st.erase(it);
			pair<int,int>tmp = *it;
			tmp.x--;
			tmp.x = max(0 , tmp.x);
			ans[i] = tmp.y;
			st.insert(tmp);
		}
	}
	for(int i = 0 ; i < n ; i ++){
		cout << ans[i] <<" ";
	}
	cout << endl;
}            
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
	cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}