#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

const char nl = '\n';

int N, K;
vi A;
vi res;

bool ok(int cap) {
    vi notCap, notZero;
    F0R(i, K) notCap.pb(i);
    int cur[K]; F0R(i, K) cur[i] = 0;
    int pc = 0, pz = 0;
    F0R(i, N) {
        if (A[i] == 1) {
            while (pc < sz(notCap) && cur[notCap[pc]] == cap) pc++;
            if (pc == sz(notCap)) return false;
            cur[notCap[pc]]++;
            if (cur[notCap[pc]] == 1) {
                notZero.pb(notCap[pc]);
            }
            res[i] = notCap[pc];
        } else {
            while (pz < sz(notZero) && cur[notZero[pz]] == 0) pz++;
            if (pz == sz(notZero)) {
                res[i] = 0;
            } else {
                cur[notZero[pz]]--;
                if (cur[notZero[pz]] == cap-1) {
                    notCap.pb(notZero[pz]);
                }
                res[i] = notZero[pz];
            }
        }
    }
    return true;
}

void solve() {
    cin >> N >> K;
    A = vi(N);
    res = vi(N);
    F0R(i, N) cin >> A[i];
    int lo = 0, hi = N;
    while (lo < hi) {
        int mid = (lo+hi)/2;
        if (ok(mid)) {
            hi = mid;
        } else lo = mid+1;
    }
    ok(lo);
    F0R(i, N) {
        cout << res[i]+1 << " ";
    }
    cout << nl;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
    int T; cin >> T;
	while (T--) solve();
	return 0;
}