#include<bits/stdc++.h>
using namespace std;
#define V vector
#define all1(x) (x).begin() + 1, (x).end()
#define fi first
#define se second
typedef pair<int, int> pi;

void solve() {
    int n, k; cin >> n >> k;
    V<int> a(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i];

    multiset<pi> st;
    for(int i = 1; i <= k; i++) st.insert({0, i});
    V<int> ans(n + 1);
    for(int i = 1; i <= n; i++) {
        if(a[i] == -1) {
            auto it = prev(st.end());
            auto [x, id] = *it;
            x = max(x - 1, 0);
            st.erase(it);
            st.insert({x, id});
            ans[i] = id;
            // cout << a[i] << " " << x << " " << id << endl;
        }
        else {
            auto it = st.begin();
            auto [x, id] = *it;
            x = x + 1;
            st.erase(it);
            st.insert({x, id});
            ans[i] = id;
            // cout << a[i] << " " << x << " " << id << endl;
        }
    }
    for(int i = 1; i <= n; i++) cout << ans[i] << " ";
    cout << endl;
}
int main() {
    int t; cin >> t;
    while(t--) solve();
}