#include <bits/stdc++.h>
#define all(a) begin(a), end(a)
#define int long long
using namespace std;

const int N = 2e5 + 11;
int a[N], b[N];
int n, k; 

bool test(int x){
	deque<int> dq; int bc = 0;
	vector<int> rem;
	for (int i = 1; i <= k; i++) {
		rem.push_back(i);
	}
	for (int i = 0; i < n; i++) {
		if (a[i] == -1) {
			if (dq.empty()) {
				b[i] = 1;
			} else {
				b[i] = dq.back();
				--bc;
				if (bc == 0) {
					rem.push_back(dq.back());
					dq.pop_back();
					bc = x;
				}
			}
		} else {
			if (x == 0) return false;
			if (dq.empty() || bc == x) {
				if (rem.empty()) return false;
				b[i] = rem.back(); bc = 1;
				rem.pop_back(); dq.push_back(b[i]);
			} else {
				b[i] = dq.back(); ++bc;
			}
		}
	}
	return true;
}

void solve(){
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	int lo = 0, hi = n;
	while (lo != hi) {
		int mid = (lo + hi) / 2;
		if (test(mid)) {
			hi = mid;
		} else {
			lo = mid + 1;
		}
	}
	// cout << lo << '\n';
	test(lo);
	for (int i = 0; i < n; i++) {
		cout << b[i] << ' ';
	}
	cout << '\n';
}

int32_t main(){
#ifndef LOCAL
	cin.tie(0)->sync_with_stdio(false);
#endif
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}