#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, K;
vector<int> A;

vector<int> ks;
bool check(int t) {
  ks.assign(N, -1);
  priority_queue<pair<int, int>> que;
  priority_queue<int> queT;
  for (int k = 0; k < K; ++k) {
    queT.push(k);
  }
  for (int i = 0; i < N; ++i) {
    if (A[i] > 0) {
      if (queT.size()) {
        const int k = queT.top();
        queT.pop();
        if (t == 0) return false;
        ks[i] = k;
        que.emplace(t - 1, k);
      } else {
        const int f = que.top().first;
        const int k = que.top().second;
        que.pop();
        if (f == 0) return false;
        ks[i] = k;
        que.emplace(f - 1, k);
      }
    } else {
      if (que.size()) {
        const int f = que.top().first;
        const int k = que.top().second;
        que.pop();
        ks[i] = k;
        if (f + 1 == t) {
          queT.push(k);
        } else {
          que.emplace(f + 1, k);
        }
      } else if (queT.size()) {
        const int k = queT.top();
        queT.pop();
        ks[i] = k;
        queT.push(k);
      }
    }
  }
// cerr<<"check "<<t<<": "<<ks<<endl;
  return true;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &N, &K);
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    
    int lo = -1, hi = N;
    for (; lo + 1 < hi; ) {
      const int mid = (lo + hi) / 2;
      (check(mid) ? hi : lo) = mid;
    }
// cerr<<"hi = "<<hi<<endl;
    check(hi);
    for (int i = 0; i < N; ++i) {
      if (i) printf(" ");
      printf("%d", ks[i] + 1);
    }
    puts("");
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}