#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<array>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n, k;
        cin >> n >> k;
        vector<int> a(n + 1);
        for(int i = 1; i <= n; i++) cin >> a[i];
        set<pair<int, int> > s;
        for(int i = 1; i <= k; i++){
            s.insert({0, i});
        }
        for(int i = 1; i <= n; i++){
            if (a[i] == 1){
                auto [x, y] = *s.begin();
                cout << y << ' ';
                x = max(x + 1, 0);
                s.erase(s.begin());
                s.insert({x, y});
            }
            else{
                auto [x, y] = *prev(s.end());
                cout << y << ' ';
                x = max(x - 1, 0);
                s.erase(prev(s.end()));
                s.insert({x, y});
            }
        }
        cout << '\n';
    }

}