#include <ios>
#include <iostream>
#include <iterator>
#include <set>
 
const int N = 2e5+5;
 
int a[N];
int b[N];
 
int n, k;
 
 
bool chk(int mx) {
    std::set<std::pair<int, int>> S;
    for (int i = 1; i <= k; ++i) S.emplace(0, i);
    for (int i = 1; i <= n; ++i) {
        if (a[i] == 1) {
            auto [v, id] = *S.begin();
            ++v;
            if (v > mx) return false;
            b[i] = id;
            S.erase(S.begin());
            S.emplace(v, id);
        } else {
            auto [v, id] = *S.rbegin();
            --v;
            v = std::max(v, 0);
            b[i] = id;
            S.erase(std::prev(S.end()));
            S.emplace(v, id);
        }
    }
    return true;
}
 
void sol() {
    std::cin >> n >> k;
    for (int i = 1; i <= n; ++i) std::cin >> a[i];
    if (!chk(0)) {
        int l = 0, r = n + 1;
        while (r != l + 1) {
            int m = (l + r) / 2;
            if (chk(m)) r = m;
            else l = m;
        }
    }
    for (int i = 1; i <= n; ++i) std::cout << b[i] << " \n"[i==n];
    
}
 
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(0);
    int T;
    std::cin >> T;
    while (T--) sol();
    return 0;
}