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

using pii = pair<int, int>;

void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n), tmp(n), ans;
    for(int i = 0; i < n; i ++)
        cin >> a[i];
    if(-1 == *max_element(a.begin(), a.end())) {
        for(int i = 0; i < n; i ++)
            cout << "1" << " \n"[i + 1 == n];
        return;
    }
    int l = 0, r = n;
    while(l + 1 < r) {
        int mid = (l + r) / 2;
        if([&n, &k, &a, &tmp](int len) {
            vector<int> full, c(k + 1, len);
            queue<int> q;
            
            for(int i = 1; i <= k; i ++)
                q.push(i);
            for(int i = 0; i < n; i ++) {
                if(a[i] == 1) {
                    if(q.empty()) return false;
                    tmp[i] = q.front();
                    if(--c[q.front()] == 0) {
                        full.push_back(q.front());
                        q.pop();
                    }
                }else{
                    if(full.size()) {
                        q.push(full.back());
                        tmp[i] = full.back();
                        c[full.back()] = len;
                        full.pop_back();
                    }else{
                        tmp[i] = q.front();
                        c[q.front()] = len;
                    }
                }
            }
            return true;
        }(mid)) {
            ans = tmp;
            r = mid;
        }
        else l = mid;
    }
    for(int i = 0; i < n; i ++)
        cout << ans[i] << " \n"[i + 1 == n];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T;
    cin >> T;
    while(T --)
        solve();
}