#include<bits/stdc++.h>

#define forn(i,n) for(int i = 0; i< (int)n;++i)
#define for1(i,n) for(int i = 1; i<= (int)n;++i)
#define fore(i,l, r) for(int i = l; i<= r;++i)
#define ford(i,n) for(int i = (int)n - 1; i >= 0;--i)
#define all(a) a.begin(), a.end()
#define el '\n'
#define d(x) cerr<<#x<<" "<<x<<el
#define fi first
#define se second
#define pb push_back

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> ii;
typedef long long ll;

void solve(){
    int n, k;
    cin >> n >> k;
    vi a(n);
    forn(i, n){
        cin >> a[i];
    }
    vi ans(n);
    vi ttl(k);
    set<ii> s;
    int st = 0;
    while(st < n && a[st] == -1)++st;
    forn(i, k)s.insert({0, i});
    fore(i, st, n - 1){
        if(a[i] == 1){   
            auto it = s.begin();
            ii cur = (*it);
            ans[i] = cur.se;
            ttl[cur.se]++;
            s.erase(it);
            s.insert({ttl[cur.se], cur.se});
        }else{
            auto it = s.rbegin();
            ii cur = (*it);
            ans[i] = cur.se;
            ttl[cur.se]--;
            ttl[cur.se] = max(0, ttl[cur.se]);
            s.erase(cur);
            s.insert({ttl[cur.se], cur.se});
        }
    }
    for(int& v : ans)cout << v + 1 << ' ';
    cout << el;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int tt = 1;
    cin>>tt;
    while(tt--){
        solve();
    }
}