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

#define rep(i, n, N) for (int i = (n); i <= (N); i++)
#define For(i, n, N) for (int i = (n); i <  (N); i++)
#define rap(i, n, N) for (int i = (n); i >= (N); i--)
#define rip(i, n, N, V) for (int i = (n); i <= (N); i += V)

using vi = vector<int>;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using lll = __int128;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
using plll = pair<lll, lll>;

#define fi first
#define se second
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front

#define endl '\n'
#define all(x) x.begin(), x.end()
#define clz(x) (1 << (31 - __builtin_clz(x)))
#define ari(x) array<int, x>
#define arll(x) array<ll, x>
#define mems(x, y) memset(x, y, sizeof x)
#define debug(x) cout << #x << " = " << (x) << endl
#define debugV(v, x) cout << #v << "[" << (x) <<> "] = " << v[x] << endl
#define out(x, y) cout << "]] " << (x) << " " << (y) << endl

#ifdef LOCAL
#define DEBUG(...) __VA_ARGS__;
#else
#define DEBUG(...)
#endif

template<class A, class B>
ostream& operator<<(ostream& os, const pair<A, B> &p) {
    return os << "(" << p.fi << ", " << p.se << "\n";
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &v) {
    os << "{"; bool osu = 1;
    for (auto i : v) {if (!osu) {os << ", ";} os << i; osu = 0;}
    return os << "}";
}
template<class T, ull sz>
ostream& operator<<(ostream& os, const array<T, sz> &v) {
    os << "{"; bool osu = 1;
    for (auto i : v) {if (!osu) {os << ", ";} os << i; osu = 0;}
    return os << "}";
}

const int MAX = 4e5 + 5;

int tc,n,k,a;
set<pii> s;
pii b;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin>>tc;
    while(tc--){
        cin>>n>>k;
        s.clear();
        rep(i,1,k)s.insert({0,i});
        auto it = s.begin();
        rep(i,1,n){
            cin>>a;
            if(a==1){
                it = s.begin();
                b = *it;
                s.erase(it);
                b.fi++;
                s.insert(b);
            }
            else {
                it = s.end();
                --it;
                b = *it;
                s.erase(it);
                b.fi = max(0, b.fi-1);
                s.insert(b);
            }
            cout<<b.se<<" ";
        }
        cout<<endl;
    }
    return 0;
}