#include <iostream>
#include <fstream>
#include <vector>
#include <set>

using namespace std;

void solve() {
    int n, k, maxsum = 0, curr = 0;
    cin >> n >> k;
    vector <int> v(n);
    set <pair <int, int>> s;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        curr = max(curr + v[i], v[i]);
        maxsum = max(maxsum, curr);
    }
    maxsum = (maxsum + k - 1) / k;
    for (int i = 1; i <= k; i++) {
        s.insert({0, i});
    }
    for (int i = 0; i < n; i++) {
        if (v[i] == -1) {
            auto it = s.rbegin();
            pair <int, int> aux = (*it);
            s.erase(*it);
            aux.first--;
            if (aux.first < 0) {
                aux.first = 0;
            }
            s.insert(aux);
            cout << aux.second << ' ';
        }
        else {
            auto it = s.begin();
            pair <int, int> aux = (*it);
            s.erase(*it);
            aux.first++;
            s.insert(aux);
            cout << aux.second << ' ';
        }
    }
    cout << '\n';
}

int main()
{
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    int nrTeste;
    cin >> nrTeste;
    while (nrTeste--) {
        solve();
    }
    return 0;
}