#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, l, r) for (ll i = l; i < r; i++)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, const auto &b) { return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, const auto &b) { return a < b ? a = b, 1 : 0; }

struct IOSetup {
  IOSetup() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template <class T>
void print(vector<T> a) {
  for (auto x : a) cerr << x << ' ';
  cout << endl;
}

void print(auto x) { cout << x << endl; }

template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

vi calc(int n,int k,vi &a, int mid){
  vi res(k,0),ans;
  int tmp=0;
  rep(i,n){
    if(a[i]==1){
      while(tmp!=k&&res[tmp]==mid){
        tmp++;
      }
      if(tmp==k)return {};
      res[tmp]++;
      ans.push_back(tmp);
    }
    else{
      while(tmp>0&&res[tmp]==0)tmp--;
      res[tmp]=max(0,res[tmp]-1);
      ans.push_back(tmp);
    }
  }
  return ans;
}

void solve(){
  int n,k;
  cin>>n>>k;
  vi a(n);
  rep(i,n)cin>>a[i];
  int ok=n,ng=-1;
  while(ok-ng>1){
    int mid=(ok+ng)/2;
    if(calc(n,k,a,mid).size()>0)ok=mid;
    else ng=mid;
  }
  vi ans=calc(n,k,a,ok);
  rep(i,n)cout<<ans[i]+1<<" \n"[i+1==n];
}

int main() {
  int T;
  cin>>T;
  rep(i,T)solve();
}