#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int q; cin >> q;
    while (q--) {
        int n; cin >> n;
        int k; cin >> k;
        vector<int> a(n);
        int m = 0;
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
            if (a[i] == -1) m += 1;
        }
        if (m == n) {
            for (int i = 0; i < n; ++i) {
                cout << 1 << " ";
            }
            cout << "\n";
            continue;
        }
        int l = 0, r = n+1;
        vector<int> res(n, -1);
        auto check = [&](int x) -> bool {
            vector<int> z,p,q;
            vector<int> sum(k);
            for (int i = 0; i < k; ++i) {
                z.push_back(i);
            }
            for (int i = 0; i < n; ++i) {
                if (a[i] == 1) {
                    if (z.size() == 0 and p.size() == 0) return false;
                    if (z.size()) {
                        int j = z.back(); z.pop_back();
                        sum[j] += 1;
                        res[i] = j;
                        if (sum[j] == x) {
                            q.push_back(j);
                        }
                        else {
                            p.push_back(j);
                        }
                    }
                    else {
                        int j = p.back();
                        sum[j] += 1;
                        res[i] = j;
                        if (sum[j] == x) {
                            q.push_back(j); p.pop_back();
                        }
                    }
                }
                else {
                    if (q.size()) {
                        int j = q.back(); q.pop_back();
                        sum[j] -= 1; res[i] = j;
                        if (sum[j] == 0) {
                            z.push_back(j);
                        }
                        else {
                            p.push_back(j);
                        }
                    }
                    else if (p.size()) {
                        int j = p.back(); 
                        sum[j] -= 1; res[i] = j;
                        if (sum[j] == 0) {
                            z.push_back(j); p.pop_back();
                        }
                    }
                    else {
                        int j = z.back();
                        res[i] = j; 
                    }
                }
            }
            return true;
        };
        while (r-l > 1) {
            int mid = (l+r)/2;
            if (check(mid)) {
                r = mid;
            }
            else {
                l = mid;
            }
        }
        check(r);
//        cerr << r << endl;
        for (int i = 0; i < n; ++i) {
            cout << res[i]+1 << " ";
        }
        cout << "\n";
    }
}