#include <bits/stdc++.h>
#define MAXN 3005
using namespace std;

const double pi = acos(-1.0);

struct point {
    int x, y;
    point() {}
    point(int _, int __): x(_), y(__) {}
    point operator - (const point &p)const {
        return point(x - p.x, y - p.y);
    }
    long long len2()const {
        return 1LL * x * x + 1LL * y * y;
    }
    double arg()const {
        return atan2(y, x);
    }
};

int n, d, ans;
long long d2;
point p[MAXN];

inline void chkmax(int &a, int b) {
    if (a < b)
        a = b;

    return ;
}
inline double norm(double x) {
    if (x >= 2 * pi)
        x -= 2 * pi;

    return x;
}

int main() {
    scanf("%d %d", &n, &d);
    d2 = 1LL * d * d;

    for (int i = 1; i <= n; i++)
        scanf("%d %d", &p[i].x, &p[i].y);

    for (int j = 1; j <= n; j++) {
        point O = p[j];
        vector<pair<double, int>> v;
        int now = 1;

        for (int i = 1; i <= n; i++) {
            if (j == i)
                continue;

            point Ov = p[i] - O;
            double alpha = Ov.arg();
            long long l2 = Ov.len2();
            auto add = [&](double l, double d) {
                double r = l + d;

                if (r >= 2 * pi) {
                    r -= 2 * pi;
                    ++now;
                }

                v.push_back({l, 1});
                v.push_back({r, -1});
            };

            if (l2 <= d2)
                add(alpha, pi);
            else {
                double beta = asin(sqrt((double)d2 / l2));
                add(alpha, beta);
                add(pi + alpha - beta, beta);
            }
        }

        sort(v.begin(), v.end());

        //printf("%d\n",now);
        //for (auto [a,b]: v) printf("%lf %d\n",a,b);
        //puts("----------");
        for (auto [_, cnt] : v)
            chkmax(ans, now += cnt);
    }

    printf("%d\n", ans);
    return 0;
}