// UW BLACK
#include <bits/stdc++.h>

#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)((x).size()))
#define rep(i,a,b) for(int i=(a);i<(b);++i)

using namespace std;

using ll = long long;
using ld = long double;
using vi = vector<int>;
using pii = pair<int,int>;

mt19937 rnd(223);

clock_t TIME0;

#define TIME ((clock() - TIME0) * 1.0 / CLOCKS_PER_SEC)

constexpr int maxn = 1e6 + 100, inf = 1e9 + 100;
using T = long double;
constexpr T EPS = 1e-9;

const ll mod = 1e9+7;

int a[maxn], sum[maxn],ans[maxn];
void solve() {
    int n,k;
    cin >> n >> k;
    for(int i=0;i<=n;i++)a[i]=sum[i]=ans[i]=0;
    for(int i=0;i<n;i++)cin >> a[i];
    set<pii> pq;
    for(int i=0;i<k;i++)pq.insert({0,i});
    for(int i=0;i<n;i++){
        if(a[i]==1){
            auto [c,ind] = *pq.begin();
            pq.erase(pq.begin());
            ans[i]=ind;
            pq.insert({c+1,ind});
        }
        else {
            auto [c,ind] = *--pq.end();
            pq.erase(--pq.end());
            ans[i]=ind;
            pq.insert({max(0,c-1),ind});
        }
    }
    for(int i=0;i<n;i++)cout << ans[i]+1 << " \n"[i==n-1];
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed;
    cout.precision(20);
    TIME0 = clock();
    int k=1;
    cin >> k;
    while(k--)
        solve();
    cerr << "\n\nConsumed " << TIME << endl;
}