#include <bits/stdc++.h>

void solve(){
    int n, k;
    std::cin >> n >> k;
    std::set<std::pair<int, int> > S;
    for (int i = 0; i < k; i += 1) {
        S.emplace(0, i);
    }
    std::vector<int> res;
    for (int i = 0; i < n; i += 1) {
        int x;
        std::cin >> x;
        if (x == 1) {
            auto [x, id] = *S.begin();
            S.erase(*S.begin());
            x += 1;
            S.emplace(x, id);
            res.emplace_back(id);
        } else {
            auto [x, id] = *S.rbegin();
            S.erase(*S.rbegin());
            x -= 1;
            x = std::max(x, 0);
            S.emplace(x, id);
            res.emplace_back(id);
        }
    }
    // auto [x, id] = *S.rbegin();
    // std::cout << x << '\n';
    for (int i = 0; i < n; i += 1) {
        std::cout << res[i] + 1 << " \n"[i + 1 == n];
    }
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int T;
    std::cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}