#include <bits/stdc++.h>
#define ll long long
#define int 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;
    int a[n], cnt1 = 0, cnt2 = 0, q = 0;
    for(auto&e: a) cin >> e;
    int ind = 0;
    cout << ind+1 << ' ';
    queue<int> stp, stn; // stack ends with 1, ends with -1
    for(int i = 1; i < k; i++){
        stp.push(i);
    }
    for(int i = 1; i < n; ++i){
        if(a[i] == a[i-1]){
            if(a[i] == 1){
                stp.push(ind);
                if(!stn.empty()){
                    ind = stn.front();
                    stn.pop();
                }
                else{
                    ind = stp.front();
                    stp.pop();
                }
            }
            else{
                stn.push(ind);
                if(!stp.empty()){
                    ind = stp.front();
                    stp.pop();
                }
                else{
                    ind = stn.front();
                    stn.pop();
                }
            }
            ind %= k;
        }
        cout << ind+1 << ' ';
    }

    cout << '\n';
}

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

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