#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pl pair<ll,ll>
#define x first
#define y second
const ll N=5e5+10;
pl f[N],s[N],inc[N];
ll n,r;
bool check(int i,int p)
{
ll fx=(f[i].x+inc[i].x*p);
ll fy=(f[i].y+inc[i].y*p);
return (fx*fx+fy*fy)<=(r*r);
}
void solve()
{
cin>>n>>r;
for(int i=1;i<=n;i++)
{
cin>>f[i].x>>f[i].y>>s[i].x>>s[i].y;
inc[i].x=(s[i].x-f[i].x);
inc[i].y=(s[i].y-f[i].y);
}
int as=0;
for(int p=0;p<=2e4;p++)
{
int ans=0;
for(int i=1;i<=n;i++)
{
ans+=check(i,p);
}
as=max(as,ans);
}
cout<<as<<endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
while(t--)solve();
return 0;
}
