#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define ALL(x) x.begin(), x.end()
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;

typedef pair<int,int> ii;

const int INF = 1e9;
int t;
int n, k;
int A[200003];
int ans[200003];

bool cek(int x)
{
    multiset<ii> st;
    for(int i = 1; i <= k; i++) st.insert({0, i});
    for(int i = 1; i <= n; i++)
    {
        if(A[i] == 1)
        {
            auto it = st.upper_bound({x-1, INF});
            if(it == st.begin()) return 0;
            --it;
            ans[i] = it->se;
            ii tmp = {it->fi+1, it->se};
            st.erase(it);
            st.insert(tmp);
        }
        else
        {
            auto it = --st.end();
            ans[i] = it->se;
            if(it->fi != 0)
            {
                ii tmp = {it->fi-1, it->se};
                st.erase(it);
                st.insert(tmp);
            }
        }
    }
    return 1;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> t;
    while(t--)
    {
        cin >> n >> k;
        for(int i = 1; i <= n; i++) cin >> A[i];
        int kir = 0, kan = n;
        while(kir < kan)
        {
            int mid = (kir+kan)/2;
            if(cek(mid)) kan = mid;
            else kir = mid+1; 
        }
        cek(kir);
        // cout << kir << "\n";
        for(int i = 1; i <= n; i++)
        {
            cout << ans[i] << " ";
        } cout << "\n";
    }
    return 0;
}