#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
const int MAXN = 3005;
const LD PI = acosl(-1.0);
const LD eps = 1e-7;

struct Point {
    LL x, y;
    Point(LL x = 0, LL y = 0) : x(x), y(y) {}
    Point operator + (const Point &rhs) const {
        return Point(x + rhs.x, y + rhs.y);
    }
    Point operator - (const Point &rhs) const {
        return Point(x - rhs.x, y - rhs.y);
    }
    LL operator * (const Point &rhs) const {
        return x * rhs.x + y * rhs.y;
    }
    LL operator ^ (const Point &rhs) const {
        return x * rhs.y - y * rhs.x;
    }
    Point operator * (const double &k) const {
        return Point(x * k, y * k);
    }
    Point operator / (const double &k) const {
        return Point(x / k, y / k);
    }
    LL len2() {
        return x * x + y * y;
    }
    double len() {
        return sqrt(len2());
    }
    Point Unit() {
        return *this / len();
    }
} p[MAXN];

int n, ans;
LL t, t2;
pair<LD, int> a[MAXN * 8]; int tot = 0;

void Add(LD l, LD r) {
    while (r < -PI) {
        l += PI * 2;
        r += PI * 2;
    }
//cerr << l << ' ' << r << endl;
    if (l < -PI) {
        a[++tot] = make_pair(l + PI * 2, 1);
        a[++tot] = make_pair(PI, -1);
        a[++tot] = make_pair(-PI, 1);
        a[++tot] = make_pair(r, -1);
    } else {
        a[++tot] = make_pair(l, 1);
        a[++tot] = make_pair(r, -1);
    }
}

void Work(int k) {
//cerr << "solve " << k << endl;
    tot = 0;
    for (int i = 1; i <= n; ++i) {
        //cerr << "cover " << i << endl;
        if (i == k) continue;
        LL len2 = (p[i] - p[k]).len2();
        LD l, r = atan2l(p[i].y - p[k].y, p[i].x - p[k].x);
        if (t2 >= len2) {
            Add(r - PI, r);
        } else {
            LD cur = asinl(t / sqrtl(len2));
            Add(r - cur, r);
            Add(r - PI, r - PI + cur);
        }
    }
    sort(a + 1, a + tot + 1);
    int cnt = 0;
    for (int i = 1; i <= tot; ++i) {
        cnt += a[i].second;
        ans = max(ans, cnt + 1);
    }
//cerr << "ans " << ans << endl;
}

void solve() {
    scanf("%d %lld", &n, &t);
    t2 = t * t;
    for (int i = 1; i <= n; ++i) {
        scanf("%lld %lld", &p[i].x, &p[i].y);
    }
    ans = 0;
    for (int i = 1; i <= n; ++i) {
        Work(i);
    }
    printf("%d\n", ans);
}

int main() {
    solve();
    return 0;
}