//#pragma GCC optimize("O3, unroll-loops")
//#pragma GCC target("avx2, bmi, bmi2, lzcnt, popcnt")
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define all0(x) (x).begin(), (x).end()
#define all1(x) (x).begin() + 1, (x).end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define cin std::cin
#define cout std::cout
typedef long long LL;
typedef pair<int, int> pi;
typedef pair<LL, LL> pl;
#ifdef LOCAL
#include "C:/Users/lijia/Desktop/vscode/algo/debug.h"
#else
#define debug(...) 42
#endif

//const int MN = 2e5 + 20;//MaxN 记得改一下
const int INF = 2e9 + 1000;//INF
const LL INFLL = 8e18 + 1000;//INF long long 
mt19937 mrand(random_device{}());
//模板区域~~~~~~~

//模板结束~~~~~~~

void solve() {
    int n; cin >> n;
    int k; cin >> k;
    V<pi> a(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i].fi >> a[i].se;
    }
    LL l = 0, r = 1e18;
    auto ok = [&](LL mid){
        V<int> vis(n + 1);
        int cnt = 0;
        for(int i = 1; i <= n && cnt < k; i++) { 
            if(vis[i]) continue;
            vis[i] = 1;
            cnt++;
            auto sqr = [&] (int x) -> LL {return 1LL * x * x;};
            auto dis = [&] (pi a, pi b) -> LL {
                return sqr(a.fi - b.fi) + sqr(a.se - b.se);
            };
            for(int j = 1; j <= n; j++) {
                if(vis[j] == 1) continue;
                if(dis(a[i], a[j]) <= mid) vis[j] = 1;
            }
        }
        if(cnt < k) return 0;
        return 1;
    };
    while(l != r) {
        LL mid = (l + r + 1) / 2;
        if(ok(mid)) l = mid;
        else r = mid - 1;
    }
    debug(l);
    V<int> vis(n + 1);  
    int now = 1;
    for(int i = 1; i <= n; i++) { 
        if(vis[i]) continue;
        vis[i] = now;
        auto sqr = [&] (int x) -> LL {return 1LL * x * x;};
        auto dis = [&] (pi a, pi b) -> LL {
            return sqr(a.fi - b.fi) + sqr(a.se - b.se);
        };
        for(int j = 1; j <= n; j++) {
            if(vis[j]) continue;
            if(dis(a[i], a[j]) <= l) vis[j] = now;
        }
        now++;
    }
    for(int i = 1; i <= n; i++) {
        cout << vis[i] << " \n"[i == n];
    }

}
int32_t main() {
#ifndef LOCAL
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
#ifdef LOCAL
   freopen("C:/Users/lijia/Desktop/vscode/in.in", "r", stdin);
   freopen("C:/Users/lijia/Desktop/vscode/out.out", "w", stdout);
#endif
    int tt = 1;
    cin >> tt;
    while (tt--) 
    solve();
}