#include <bits/stdc++.h>

#define pb push_back
#define f first
#define s second
 
using ll = long long;
using namespace std;

const int MOD = 1e9 + 7;

int main(){
    int t;
    cin >> t;
    while(t--){
        int n, k;
        cin >> n >> k;
        vector<int> elems(n);
        for(int i = 0; i < n; i++){
            cin >> elems[i];
        }
        vector<int> ans(n);
        set<pair<int, int>> pq;
        for(int i = 1; i <= k; i++){
            pq.insert({0, i});
        }
        for(int i = n - 1; i >= 0; i--){
            if(elems[i] == 1){
                auto small = *pq.begin();
                pq.erase(small);
                ans[i] = small.s;
                small.f++;
                pq.insert(small);
            } else {
                auto big = *pq.rbegin();
                pq.erase(big);
                ans[i] = big.s;
                big.f--; big.f = max(big.f, 0);
                pq.insert(big);
            }
        }
        for(int x : ans){
            cout << x << " ";
        }
        cout << endl;
    }
}