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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
#include <experimental/iterator>
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define orange(...) safe
#define debug(...) safe
#endif

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int &ai : a)
      cin >> ai;
    map<int, queue<int>> qs;
    for (int i = 1; i <= k; ++i)
      qs[0].push(i);
    for (int i = 0; i < n; ++i) {
      if (a[i] == 1) {
        auto it = qs.begin();
        int x = it->second.front();
        it->second.pop();
        cout << x;
        qs[it->first + 1].push(x);
        if (it->second.empty())
          qs.erase(it);
      } else {
        auto it = prev(qs.end());
        int x = it->second.front();
        it->second.pop();
        cout << x;
        qs[max(it->first - 1, 0)].push(x);
        if (it->second.empty())
          qs.erase(it);
      }
      cout << " \n"[i + 1 == n];
    }
  }
  return 0;
}