#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define INF 1000000000
#define INFl 1000000000000000000
#define all(x) x.begin(), x.end()
#define sajz(x) (int)x.size()
#define pb push_back
#define se second
#define fi first
#define yes puts("YES")
#define no puts("NO")
#define erase_duplicates(x) {sort(all(x));(x).resize(distance((x).begin(), unique(all(x))));}
using namespace std;
//using namespace __gnu_pbds;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int ll

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef set<int> si;
typedef multiset<int> msi;
typedef long double ld;
//typedef cc_hash_table<int, int, hash<int>> ht;

void test_case() {
	int n, k;
	cin >> n >> k;

	vll x(n), y(n), grupa(n);

	for (int i = 0; i < n; i ++) {
		cin >> x[i] >> y[i];
	}

	grupa[0] = 1;
	vll mini(n);

	for (int i = 0; i < n; i ++) {
		mini[i] = llabs(x[i]-x[0])+llabs(y[i]-y[0]);
	}

	vll Kapitan;
	Kapitan.pb(0);

	for (int g = 2; g <= k; g ++) {
		ll best = -1, ile = 0;
		for (int i = 0; i < n; i ++) {
			if (grupa[i]) continue;
			if (ile < mini[i]) {
				ile = mini[i];
				best = i;
			}
		}

		grupa[best] = g;

		for (int i = 0; i < n; i ++) {
			mini[i] = min(mini[i], llabs(x[i]-x[best])+llabs(y[i]-y[best]));
		}
		Kapitan.pb(best);
	}

	assert(sajz(Kapitan) == k);

	vector<pair<ll, int>> M(n);

	for (int i = 0; i < n; i ++) {
		M[i] = {INFl, -1};
		for (auto K : Kapitan) {
			ll odl = llabs(x[K]-x[i]) + llabs(y[K]-y[i]);
			if (odl < M[i].first) {
				M[i].first = odl;
				M[i].second = K;
			}
		}
	}

	for (int i = 0; i < n; i ++) {
		if (!grupa[i]) {
			grupa[i] = grupa[M[i].second];
		}
	}

	for (int i = 0; i < n; i ++) cout << grupa[i] << ' ';
	cout << '\n';
}

int32_t main() {
	ios_base::sync_with_stdio(false);
	cout.tie(0);
	cin.tie(0);
	int t=1;
	cin >> t;
	for (int i = 1; i <= t; i ++) {
		test_case();
	}
}