#include<bits/stdc++.h>
#define int long long
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")

using namespace std;
const int N = 2e5 + 5;
int a[N];
int n, k;
bool check(int x){
    set<pair<int, int> > s;
    for(int i = 1; i <= k; i++){
        s.insert({0, i});
    }
    for(int i = 1; i <= n; i++){
        if(a[i] == -1){
            pair<int, int> back = *prev(s.end());
            s.erase(prev(s.end()));
            back.first -= 1;
            s.insert(back);
        }else{
            if(s.begin()->first >= x)
                return 0;
            pair<int, int> back = *(s.begin());
            s.erase(s.begin());
            back.first += 1;
            s.insert(back);
        }
    }
    return 1;
}
void solve(){
    cin >> n >> k;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }

    int ll = 0, rr = n;

    while(ll < rr){
        int mid = ll + rr >> 1;
        if(check(mid)){
            rr = mid;
        }else{
            ll = mid + 1;
        }
    }

    set<pair<int, int> > s;
    for(int i = 1; i <= k; i++){
        s.insert({0, i});
    }
    for(int i = 1; i <= n; i++){
        if(a[i] == -1){
            pair<int, int> back = *prev(s.end());
            s.erase(prev(s.end()));
            cout << back.second << ' ';
            back.first -= 1;
            s.insert(back);
        }else{
            pair<int, int> back = *(s.begin());
            s.erase(s.begin());
            cout << back.second << ' ';
            back.first += 1;
            s.insert(back);
        }
    }
    cout << '\n';
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
}