#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PI pair<int, int>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define bust ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll INF = (ll)1e9 + 7, mod = 998244353;




void solve(){
    int n, k;
    cin >> n >> k;
    set<pair<int, int> > st;
    for(int i = 0; i < k; i++) st.insert({0, i});
    for(int i = 0; i < n; i++){
        int x;
        cin >> x;
        if(x == 1){
            auto [v, ind] = *st.begin();
            st.erase(st.begin());
            cout << ind+1 << " ";
            st.insert({v+1, ind});
        }
        else{
            auto [v, ind] = *st.rbegin();
            st.erase(--st.end());
            cout << ind+1 << " ";
            st.insert({max(v - 1, 0), ind});
        }
    }
    cout << '\n';
}

signed main() {
    bust
    int t;
    cin >> t;

    while (t--) {
        solve();
    }
    return 0;
}