#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define ALL(x) x.begin(), x.end()
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;

typedef pair<int,int> ii;

const int INF = 1e9;
int t;
int n, k;
int A[200003];
int ans[200003];
vector<int> vec[200003];
vector<int> num;

void pop(int mx)
{
    vec[mx].pop_back();
    if(vec[mx].empty())
    {
        if(mx == num.back()) num.pop_back();
        else
        {
            num[num.size()-2] = num.back();
            num.pop_back();
        }
    }
}

void push(int mx, int j)
{
    vec[mx].push_back(j);
    if(vec[mx].size() == 1)
    {
        if(num.empty() || mx > num.back()) num.push_back(mx);
        else 
        {
            num.push_back(num.back());
            num[num.size()-2] = mx;
        }
    }
}

bool cek(int x)
{
    // cout << "X : " << x << "\n";
    multiset<ii> st;
    num = {0};
    for(int i = 0; i <= n; i++) vec[i] = {};
    for(int i = 1; i <= k; i++) vec[0].push_back(i);
    for(int i = 1; i <= n; i++)
    {
        if(A[i] == 1)
        {
            if(num.size() == 1 && num.back() == x) return 0;
            int mx = num.back();
            // cout << "I   : " << i << " " << mx << "\n";
            // cout << "num : "; for(int x : num) cout << x << " "; cout << "\n";
            if(mx == x) mx = num[num.size()-2];
            
            int j = vec[mx].back();
            ans[i] = j;
            pop(mx);
            // cout << "num : "; for(int x : num) cout << x << " "; cout << "\n";
            push(mx+1, j);
        }
        else
        {
            int mx = num.back();
            int j = vec[mx].back();
            // cout << "I   : " << i << " " << mx << "\n";
            // cout << "num : "; for(int x : num) cout << x << " "; cout << "\n";
            ans[i] = j;
            if(mx != 0)
            {
                pop(mx);
                push(mx-1, j);
            }
        }
    }
    return 1;
}

int main() {
    // ios_base::sync_with_stdio(0);
    // cin.tie(0);
    cin >> t;
    while(t--)
    {
        cin >> n >> k;
        for(int i = 1; i <= n; i++) cin >> A[i];
        int kir = 1, kan = n;
        while(kir < kan)
        {
            int mid = (kir+kan)/2;
            if(cek(mid)) kan = mid;
            else kir = mid+1; 
        }
        cek(kir);
        // cout << kir << "\n";
        for(int i = 1; i <= n; i++)
        {
            cout << ans[i] << " ";
        } cout << "\n";
    }
    return 0;
}