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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    cin >> t;

    auto solve = [&]() {
        int n, k;
        cin >> n >> k;

        vector<int> a(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }

        vector<int> cur(k);
        set<pair<int, int>> s;
        for (int i = 0; i < k; i++) {
            s.emplace(cur[i], i);
        }

        for (int i = 0; i < n; i++) {
            auto it = a[i] == 1 ? s.begin() : prev(s.end());
            int j = it->second;
            s.erase(it);
            cout << j + 1 << " \n"[i + 1 == n];
            cur[j] = max(cur[j] + a[i], 0);
            s.emplace(cur[j], j);
        }
    };

    while (t--) {
        solve();
    }
    
    return 0;
}