#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <set>

using namespace std;
typedef long long LL;
#define int LL
const int N = 2e5+10,P = N*10*10,M = N*2,mod = 1e9+7,INF = 1e9;
#define x first
#define y second
typedef pair<int,int> PII;
int n,k;
int a[N];
int last[N];
int b[N];
priority_queue<PII> heap_max;
priority_queue<PII,vector<PII>,greater<PII>>heap_min;
signed main()
{
   ios::sync_with_stdio(false);
   cin.tie(NULL); cout.tie(NULL);
    int T;
    cin>>T;
    while(T--)
    {
       cin>>n>>k;
       for(int i = 1;i<=n;i++) cin>>a[i];
        while(heap_max.size()) heap_max.pop();
        while(heap_min.size()) heap_min.pop();
        for(int i = 1;i<=k;i++)
        {
          heap_max.push({0,i});
          heap_min.push({0,i});
          last[i] = 0;
        }
        for(int i = 1;i<=n;i++)
        {
            if(a[i]==1)
            {
              PII t;
              while(heap_min.size())
              {
               t = heap_min.top();
                heap_min.pop();
                if(last[t.y]==t.x) break;
              }
              int pos = t.second,x = t.first;
              last[pos]++;
              b[i]  = pos;
              heap_min.push({last[pos],pos});
              heap_max.push({last[pos],pos});
            }
            else
            {
               PII t;
               while(heap_max.size())
               {
                 t = heap_max.top();
                 heap_max.pop();
                 if(last[t.y]==t.x) break;
               }
              int pos = t.second,x = t.first;
              last[pos]=0;
              b[i]  = pos;
              heap_min.push({last[pos],pos});
              heap_max.push({last[pos],pos});
            }
        }
       for(int i = 1;i<=n;i++)
          cout<<b[i]<<" ";
        cout<<endl;
    }
    return 0;
}