//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(...) fprintf (stderr, __VA_ARGS__)

#define lep(i, l, r) for (int i = (l), i##_end = (r); i <= i##_end; ++ i)
#define rep(i, r, l) for (int i = (r), i##_end = (l); i >= i##_end; -- i)

char _c; bool _f; template <class T> inline void IN (T & x) {
	_f = 0, x = 0; while (_c = getchar (), ! isdigit (_c)) if (_c == '-') _f = 1;
	while (isdigit (_c)) x = x * 10 + _c - '0', _c = getchar (); if (_f == 1) x = -x;
}

const int N = 2e5 + 5;

int n, k, a[N];

inline bool check (int mid) {
	static int ok[N];
	lep (i, 0, mid + 1) ok[i] = 0;

	int l = 0, r = 0;
	ok[0] = k;

	lep (i, 1, n) {
		if (a[i] < 0) {
			while (! ok[r]) -- r;
			-- ok[r], ++ ok[max (r - 1, 0)], l = min (l, max (r - 1, 0));
		} else {
			while (! ok[l]) ++ l;
			if (l == mid) return false;
			-- ok[l], ++ ok[l + 1], r = max (r, l + 1);
		}
	}
	return true;
}
inline void testcase () {
	IN (n), IN (k);
	lep (i, 1, n) IN (a[i]);

	int l = 0, r = n - 1, p = n;
	while (l <= r) {
		int mid = l + r >> 1;
		check (mid) ? p = mid, r = mid - 1 : l = mid + 1;
	}

	set <pair <int, int> > s;
	lep (i, 1, k) s.insert ({ 0, i });

	vector <vector <int> > stk (k + 1, vector <int> ());
	lep (i, 1, n) {
		if (a[i] < 0) {
			auto [mx, id] = * -- s.end ();
			s.erase (make_pair ( mx, id ));
			s.insert (make_pair ( max (0, mx - 1), id ));
			stk[id].emplace_back ( i );
		} else {
			auto [mi, id] = * s.begin ();
			s.erase (make_pair ( mi, id ));
			s.insert (make_pair ( mi + 1, id ));
			stk[id].emplace_back ( i );
		}
	}

	s.clear ();
	lep (i, 1, k) s.insert ({ (int) stk[i].size (), i });

	for ( ; ; ) {
		if (! s.size ()) break ;
		auto [sz, id] = * s.begin ();
		if (sz > 0) break ;
		auto [bb, aa] = * -- s.end ();
		s.erase ({ bb, aa });
		s.erase ({ sz, id });
		stk[id].emplace_back ( stk[aa].back () );
		stk[aa].pop_back ();
		if (bb - 1 > 1) s.insert ({ bb - 1, aa });
	}

	vector <int> ans (n + 1);
	lep (i, 1, k) for (auto & u : stk[i]) ans[u] = i;
	lep (i, 1, n) printf ("%d%c", ans[i], " \n"[i == n]);
	debug ("p = %d\n", p);
}

signed main () {
	int t; IN (t);
	while (t -- ) testcase ();
	return 0;
}