ХУЙ

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <climits>
#include <cstdlib>
#include<time.h>
#include<iomanip>
using namespace std;
const int N = 3e5 + 7;
long long t, I, i, n, ed, cnt, k,ed2;
long long a[N];
long long num[N], col[N], ans[N],Num[N];
int main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> t;
	for (I = 0; I < t; I++) {
		cin >> n >> k;
		ed = 0;
		for (i = 1; i <= n; i++) {
			num[i] = 0;
			col[i] = 0;
			ans[i] = 0;
		}
		ans[0] = 0;
		for (i = 0; i < n; i++) {
			cin >> a[i];
			num[a[i]]++;
		}
		for (i = 1; i <= n; i++) {
			if (num[i] < k) {
				ed += num[i];
			}
			if (num[i] >= k) {
				num[i] = -1;
				col[i] = 1;
			}
		}
		ed -= ed % k;
		ed2 = 0;
		for (i = 1; i <= n; i++) {
			if (num[i] != -1 && ed2 < ed) {
				col[i] = ed2 % k;
				ed2 += num[i];
				if (ed2 <= ed) {
					Num[i] = num[i];
				}
				else {
					Num[i] = num[i] - (ed2 - ed);
				}
				num[i] = -2;
			}
		}

		for (i = 0; i < n; i++) {
			if (num[a[i]] == -1) {
				if (col[a[i]] <= k) {
					ans[i] = col[a[i]];
					col[a[i]]++;
				}
			}
			if (num[a[i]] == -2) {
				if (Num[a[i]] > 0) {
				ans[i] = col[a[i]] % k + 1;
				col[a[i]]++;
				Num[a[i]]--;
				}
			}
		}
		for (i = 0; i < n; i++) {
			cout << ans[i] << " ";
		}
		cout << "\n";
	}
}