#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;

typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;

template <typename _T>
inline void read(_T &f) {
    f = 0; _T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}

template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}

template <typename T>
void print(T x, char t) {
    print(x); putchar(t);
}

const int N = 2e5 + 5;

multiset <pii> all;
int T, n, k;

int main() {
    read(T);
    while (T--) {
        read(n); read(k); all.clear();
        for (int i = 1; i <= k; i++) all.insert(make_pair(0, i));
        for (int i = 1; i <= n; i++) {
            int a; read(a);
            if (a == 1) {
                auto it = all.begin();
                print(it -> second, i == n ? '\n' : ' ');
                all.insert(make_pair(it -> first + 1, it -> second)); all.erase(it);
            } else {
                auto it = --all.end();
                print(it -> second, i == n ? '\n' : ' ');
                all.insert(make_pair(max(0, it -> first - 1), it -> second)); all.erase(it);
            }
        }
    }
    return 0;
}