#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__uint128_t;
const int N=3e4+5,M=N*20+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const int INF=1e9+7;mt19937 rnd(263082);
int n,k,fa[N],X[N],Y[N],col[N];
ll dist(int x,int y){return 1ll*(X[x]-X[y])*(X[x]-X[y])+1ll*(Y[x]-Y[y])*(Y[x]-Y[y]);}
pii MIN(pii x,pii y){return dist(x.fi,x.se)<dist(y.fi,y.se)?x:y;}
int GF(int x){return fa[x]^x?fa[x]=GF(fa[x]):x;}
void Solve(){
	int i,j,h;scanf("%d%d",&n,&k);
	for(i=1;i<=n;i++) scanf("%d%d",&X[i],&Y[i]);
	iota(fa+1,fa+n+1,1);
	vector<int> scc;
	for(i=1;i<=k;i++) scc.eb(i);
	for(i=k+1;i<=n;i++){
		scc.eb(i);
		pair<int,int> ans={scc[0],scc[1]};
		for(j=0;j<scc.size();j++) for(h=j+1;h<scc.size();h++) ans=MIN(ans,make_pair(scc[j],scc[h]));
		fa[GF(ans.se)]=GF(ans.fi);for(j=0;j<scc.size();j++) if(scc[j]==ans.se) {scc.erase(scc.begin()+j);break;}
	}
	for(i=1;i<=n;i++) {
		for(j=0;j<scc.size();j++) if(GF(scc[j])==GF(i)) {printf("%d ",j+1);break;}
	}
	printf("\n");
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}