#include <bits/stdc++.h>
using namespace std;

#define forn(i,n) for (int i=0; i<(n); i++)
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define f first
#define s second

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;

template<typename A, typename B> ostream& operator<<(ostream & cout, pair<A,B> const &p) {
    return cout << "("<< p.f << ", "<< p.s << ")";
}
template<typename A> ostream& operator<<(ostream &cout, vector<A> const & v) {
    cout << "[";
    forn(i, v.size()) {
        if(i) cout << ", ";
        cout << v[i];
    }
    return cout << "]";
}

vector<int> a, ans;
int n, k;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int t; cin >> t;
    forn(ti, t) {
        cin >> n >> k;
        vector<int> a(n);
        bool hasone = false;
        forn(i, n) {
            cin >> a[i];
            if(a[i] == 1) hasone = true;
        }

        vector<int> ans(n);
        set<pii> s;
        forn(i, k) s.insert(mp(0, i+1));
        forn(i, n) {
            if (a[i] == 1) {
                auto it = s.begin(); 
                pii cur = *it; s.erase(it);
                ans[i] = cur.s; cur.f++; s.insert(cur);
            } else {
                auto it = s.end(); it--;
                pii cur = *it; s.erase(it);
                ans[i] = cur.s; cur.f = max(0, cur.f-1); s.insert(cur);
            }
            cout << ans[i] << ' ';
        }
        cout << '\n';

        // int lo = 0, hi = n, ans = -1;
        // while (lo <= hi) {
        //     int m = (lo+hi)/2;
        //     if (poss(m)) 
        // }

        // if(!hasone) {
        //     forn(i, n) {
        //         cout << 1 << " ";
        //     }
        //     cout << "\n";
        //     continue;
        // }

        // ll lo = 0, hi = 2*n;
        // while(lo < hi) {
        //     ll mid = (lo+hi)/2;
        //     vector<vector<int>>
        // }
    }
    
   
}