#include<bits/stdc++.h>
#define rep(i,j,k) for (int i=j;i<(k);++i)
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;

vector<bool> a;
vi b;
int n,k;



bool check(int cap){
    set<tuple<int,int>> current;
    rep(i,0,k){
        current.insert({0,i});
    }
    rep(i,0,n){
        b[i] = -1;
    }
    vi full;
    rep(i,0,n){
        if(a[i]){
            if (full.size() == k){
                return false;
            }
            auto back = current.end();
            back--;

            auto [f, j] = *back;
            b[i] = j;
            current.erase(back);
            if (f + 1 == cap){
                full.push_back(j);
            }
            else{
                current.insert({f+1, j});
            }
        }
        else{
            if (full.size()){
                int j = full.back();
                full.pop_back();
                b[i] = j;
                current.insert({0, j});
            }
            else {
                auto back = current.end();
                back--;
                auto [f,j] = *back;
                b[i] = j;
                current.erase(back);
                current.insert({0, j});
            }
        }
    }
    return true;

}

int main() {
    int tc;
    cin >> tc;
    rep(_,0,tc){
        cin >> n >> k;
        a.resize(n);
        b.resize(n);
        bool positive = false;
        rep(i,0,n){
            int c;
            cin >> c;
            a[i] = c > 0;
            if (a[i]) positive = true;
        }
        if (!positive){
            rep(i,0,n){
                cout << 1 << " ";
            }
            cout << endl;
            continue;
        }

        int lo = 1;
        int hi = n/k+2;
        vi best;
        while (lo < hi){
            int med = (lo + hi) / 2;
            if (check(med)){
                best = b;
                                hi = med;
            }
            else {
                                lo = med + 1;

            }
        }
        rep(i,0,n){
            cout << best[i]+1 << " ";
        }
        cout << endl;
    }
}