/*input
2 1
-3 -2 -1 -1
-2 2 -1 1
*/
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
using ll = long long;
using pl = pair<ll, ll>;
struct beam {
pl prad;
pl dxy; // {dx, dy}
};
int N;
ll R;
ll dis(pl a, pl b) { // squared distance
return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
// 0th second yra prad
pl getnth(ll n, beam b) {
return {b.prad.x + n * b.dxy.x, b.prad.y + n * b.dxy.y};
}
vector<beam> sk;
ll getINF(beam b) {
return ((ll)200000007) / max(abs(b.dxy.x), abs(b.dxy.y));
}
pl og = {0, 0};
ll closest(beam b) {
ll l = 0;
ll h = getINF(b);
ll m;
while (l < h) {
m = (l + h) / 2;
pl n1 = getnth(m, b);
pl n2 = getnth(m + 1, b);
ll d1 = dis(n1, og);
ll d2 = dis(n2, og);
if (d1 == d2) {
return m;
} else if (d1 < d2) {
h = m;
} else {
l = m + 1;
}
}
return l;
}
ll getFirst(beam b, ll best) {
ll l = 0;
ll h = best;
ll m;
while (l < h) {
m = (l + h) / 2;
pl n1 = getnth(m, b);
ll d1 = dis(n1, og);
if (d1 <= R * R) {
h = m;
} else {
l = m + 1;
}
}
return l;
}
ll getLast(beam b, ll best) {
ll l = best;
ll h = getINF(b);
ll m;
while (l < h) {
m = (l + h + 1) / 2;
pl n1 = getnth(m, b);
ll d1 = dis(n1, og);
if (d1 <= R * R) {
l = m;
} else {
h = m - 1;
}
}
return l;
}
int main() {
cin >> N >> R;
sk.resize(N);
for (int i = 0; i < N; ++i)
{
ll a, b, c, d;
cin >> a >> b >> c >> d;
sk[i] = beam{{a, b}, {c - a, d - b}};
}
vector<pl> inter;
for (auto b : sk) {
ll best = closest(b);
if (dis(getnth(best, b), og) > R * R) {
continue;
}
ll pirm = getFirst(b, best);
ll gal = getLast(b, best);
inter.emplace_back(pirm, +1);
inter.emplace_back(gal + 1, -1);
//[pirm, gal]
}
sort(inter.begin(), inter.end());
ll ats = 0;
ll curr = 0;
int j = 0;
while (j < (int)inter.size()) {
ll dabar = inter[j].x;
while (j < (int)inter.size() && inter[j].x == dabar) {
curr += inter[j].y;
j++;
}
ats = max(ats, curr);
}
cout << ats << '\n';
}
