#include <bits/stdc++.h>
using namespace std;
void solve()
{
    int n;cin>>n;
    int k;cin>>k;
    vector<int> a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    if(a==vector<int>(n,-1)){
        for(int i=1;i<=n;i++)cout<<1<<" \n"[i==n];
        return;
    }
    int l=1,r=n,res=n;
    vector<int> ans;
    auto check = [&](int mid){
        map<int,vector<int>> ma;
        ma[0]=vector<int>{0};
        auto get = [&](int p){
            assert(ma.find(p)!=ma.end());
            int g=ma[p].back();ma[p].pop_back();
            if(ma[p].empty())ma.erase(p);
            return g;
        };
        int siz=1;
        vector<int> as(n);
        for(int i=0;i<n;i++){
            if(a[i]==1){
                if(mid==0)return false;
                int mi=ma.begin()->first;
                if(mi==mid){
                    if(siz<k){
                        as[i]=siz;
                        ma[1].push_back(siz++);
                    }
                    else return false;
                }
                else {
                    int g=get(mi);
                    as[i]=g;
                    ma[mi+1].push_back(g);
                }
            }
            else{
                int mx=ma.rbegin()->first;
                int g=get(mx);  
                as[i]=g;
                ma[max(0,mx-1)].push_back(g);
            }
        }
        ans=as;
        return true;
    };
    while(l<=r){
        int mid=(l+r)/2;
        if(check(mid)){
            r=mid-1;
        }
        else l=mid+1;
    }
    for(auto it:ans)cout<<it+1<<" ";;cout<<"\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;while(T--)solve();
    return 0;
}