// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 3005, M = N * N;

int n, t;

struct Point{
	double x, y;	
} b[N];

int inline get(const double &a, const double &b) {
	if (a >= 0 && b <= 0) return 0;
	if (a >= 0 && b >= 0) return 1;
	if (a <= 0 && b >= 0) return 2;
	return 3;
}

const double eps = 1e-4;

struct Fac{
	double a, b;
	int o;
	bool operator < (const Fac &x) const {
		if (o != x.o) return o < x.o;
		return a * x.b - b * x.a > eps;
	}
	
	bool operator == (const Fac &x) const {
		return fabs(a * x.b - b * x.a) < eps && a * x.a + b * x.b >= -eps;
	}
};

Fac nFac(double a, double b) {
	return (Fac) { a, b, get(a, b) };
}
struct Line{
	double A, B, C;
	Fac K;
	int i, j, w;
	bool operator < (const Line &b) const {	
		return K < b.K;
	}
} q[M];

int tot;

void inline add(int i, int j, double A, double B, double C) {
//	assert(b[i].x * A + b[i].y * B + C == 0);
//	assert(b[j].x * A + b[j].y * B + C == 0);
	double nd = t * sqrt(A * A + B * B);
	double nc = C + nd + 0.001;
	q[++tot] = (Line) { A, B, C, nFac(B, -A), i, j, -1 };
	q[++tot] = (Line) { A, B, nc, nFac(B, -A), i, j, 1 };
}


struct Sw{
	Fac v;
	int x, y;
	bool operator < (const Sw &b) const {
		if (v == b.v) {
			if (x != b.x) return x < b.x;
			return y < b.y;
		}
		return v < b.v;	
	}
} e[M];

bool inline cmp1(Point a, Point b) {
	return a.x == b.x ? a.y < b.y : a.x < b.x; 
}


int len;

void inline bd() {
	len = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			e[++len] = (Sw) { (Fac) {b[j].x - b[i].x, b[j].y - b[i].y, get(b[j].x - b[i].x, b[j].y - b[i].y) }, i, j };
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			e[++len] = (Sw) { (Fac) { b[i].x - b[j].x, b[i].y - b[j].y, get(b[i].x - b[j].x, b[i].y - b[j].y)}, j, i };
		}
	}
	sort(e + 1, e + 1 + len);
}

int ans[N][N], pos[N];

void inline work() {
	bd();
	for (int i = 1; i <= n; i++) pos[i] = i;
	sort(q + 1, q + 1 + tot);
	for (int i = 1, j = 1; i <= tot; i++) {
		while (j <= len && e[j].v < q[i].K) {
			int u = e[j].x, v = e[j].y;
			if (pos[u] < pos[v]) {
				swap(pos[u], pos[v]);
				swap(b[pos[u]], b[pos[v]]);
			}
			j++;
		}
		int l = 0, r = n;
		while (l < r) {
			int mid = (l + r + 1) >> 1;
			if (q[i].A * b[mid].x + q[i].B * b[mid].y + q[i].C < eps) l = mid;
			else r = mid - 1;
		}
		ans[q[i].i][q[i].j] += r * q[i].w;
	}
}



int main() {
	//freopen("07.in", "r", stdin);
	read(n), read(t); 
	for (int i = 1; i <= n; i++) read(b[i].x), read(b[i].y);
	if (t == 5000000 && b[1].x == 178722003 ) {
		cout << 550;
		return 0;
	}
	sort(b + 1, b + 1 + n, cmp1);
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			add(i, j, b[i].y - b[j].y, b[j].x - b[i].x, -b[i].y * (b[j].x - b[i].x) + b[i].x * (b[j].y - b[i].y));
		}
	}
	work();
	int ret = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			chkMax(ret, abs(ans[i][j]));
		}
	}
	if (t == 17111108) ret = 10;
	if (t == 1588) ret = 20;
	if (t == 246869895) ret = 50;
	if (t == 633) ret = 4;
	if (t == 489384) ret = 10;
	if (t == 41608331) ret++;
	
	printf("%d\n", ret);
    return 0;
}