#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int n,k;
int a[200'100];

vi solve(int cap){
	set<pii> pq;
	vi b(n);
	rep(i,0,k) pq.insert({cap,i+1});
	rep(i,0,n){
		if(a[i]==1){
			auto itr = prev(pq.end());
			if(itr->F == 0) return {};
			b[i]=itr->S;
			pii nex{itr->F - 1, itr->S};
			pq.erase(itr);
			pq.insert(nex);
		}else{ // a[i]==-1
			auto itr = pq.begin();
			pii nex{min(cap, itr->F + 1), itr->S};
			b[i]=itr->S;
			pq.erase(itr);
			pq.insert(nex);
		}
	}
	return b;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int tests;cin>>tests;
	while(tests--){
		cin>>n>>k;
		rep(i,0,n)cin>>a[i];
		int lo = -1;
		int hi = n;
		while(lo+1<hi){
			int m = lo+(hi-lo)/2;
			vi b = solve(m);
			if(sz(b)>0) hi=m;
			else lo=m;
		}
		vi b = solve(hi);
		// cout<<hi<<": ";
		rep(i,0,n)cout<<b[i]<<' ';
		cout<<'\n';
	}
}