#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

struct DSU
{
	int n;
	VI p, sz;
	
	DSU(int _n = 0) 
	{
		n = _n;
		p.resize(n);
		iota(ALL(p), 0);
		sz.assign(n, 1);
	}
	int find(int v)
	{
		if (v == p[v])
			return v;
		return p[v] = find(p[v]);
	}
	bool unite(int u, int v)
	{
		u = find(u);
		v = find(v);
		if (u == v) 
			return false;
		if (sz[u] > sz[v])
			swap(u, v);
		p[u] = v;
		sz[v] += sz[u];
		return true;
	}
};


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n, d;
	cin >> n >> d;
	vector<PII> v(n);
	DSU ds(n);
	FOR (i, 0, n)
	{
		cin >> v[i].F >> v[i].S;
		FOR (j, 0, i)
		{
			int dx = v[i].F - v[j].F;
			int dy = v[i].S - v[j].S;
			if (dx * dx + dy * dy <= d * d)
				ds.unite(i, j);
		}
	}
	vector<PII> ans;
	FOR (i, 0, n)
		ans.PB({-ds.sz[ds.find(i)], i});
	sort(ALL(ans));
	FOR (i, 0, n)
	{
		if (i)
			cout << ' ';
		cout << ans[i].S + 1;
	}
	cout << '\n';
	
	return 0;
}