cf 734 div3

#include<stdio.h>
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
int occur_num[200005],a[200005],color[200005];
int main() {
	int t,n,k;
	cin >> t;
	while (t-- > 0) {
		cin >> n >> k;
		int num=0, goup,lss;
		priority_queue <pair<int, int>>c;
		memset(occur_num, 0, sizeof(occur_num));
		for (int i = 0; i < n; i++) {
			cin >> a[i];
			occur_num[a[i]]++;
			if (occur_num[a[i]] <= k) {
				color[i] = k;
				num++;
				c.push(make_pair(a[i], i));
			}
			else color[i] = 0;
		}
		lss = num % k;
		num = num - lss;
		goup = 1;
		while (num--) {
			color[c.top().second] = goup;
			c.pop();
			goup = goup% k + 1;
		}
		while (lss--) {
			color[c.top().second] = 0;
			c.pop();
		}
		for (int i = 0; i < n; i++) {
			cout << color[i] << ' ';
		}
		cout << endl;
	}
}