#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359;
using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 7;
const int mxn = 4e5 + 69, mxq = 1e5 + 5, sq = 500, mxv = 2e7 + 5;
//const int base = (1 <<18);
const int inf = 1e9 + 5, neg = -69420;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
//const int x[9] = {0, 1, 1, -1, -1, 2, -2, 2, -2}
int group[mxn + 1], a[mxn + 1], n, k;
vt<int>comp[mxn + 1];
bool ck(int mid){
    for(int i = 0; i <= n; i++)comp[i].clear();
    for(int i = 1; i <= k; i++)comp[0].pb(i);
    int l = 0, r = 0;
    for(int i = 1; i <= n; i++){
        
        if(a[i] == 1){
            if(l + 1 > mid)return(0);
            int u = comp[l].back(); comp[l].pop_back();
            group[i] = u; comp[l + 1].pb(u);
            r = max(r, l + 1);
            if(sz(comp[l]) == 0){
                l++; 
            }
            
        }else{
            int u = comp[r].back(); comp[r].pop_back();
            group[i] = u; comp[max(r - 1, 0)].pb(u);
            l = min(l, max(r - 1, 0));
            if(sz(comp[r]) == 0)r--;
            
            
        }
    }
    return(1);
}
void solve(){
    cin >> n >> k;
    for(int i = 1; i <= n; i++){
        cin >> a[i];

    }

    int l = 0, r = n, ans;
    
    while(l <= r){
        int mid = (l + r) >> 1;
        if(ck(mid)){
            ans = mid; r = mid - 1;
        }else{
            l = mid + 1;
        }
    }
    
   
    for(int i = 1; i <= n; i++)cout << group[i] << " ";
    cout << "\n";
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("FOSLEAGUE.INP", "r", stdin);
    //freopen("FOSLEAGUE.OUT", "w", stdout);
    int tt; cin >> tt;
    while(tt--)solve();
    return(0);
}