#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
const int N=505;
i128 ga[N],gb[N],a[N],b[N],da[N],db[N],tA[N],tB[N],T[N],ttA[N],ttB[N];
int stk[N],n,p[N];
ll m;

inline bool check(int x,int y){
	return ga[x]+max((i128)0,ga[y]-gb[x])<ga[y]+max((i128)0,ga[x]-gb[y]); 
}
inline bool cmp(int x,int y){
	i128 xa=-ga[x]+gb[x],xb=-ga[y]+gb[y];
	if(xa>=0&&xb<0)return 1;
	if(xa<0&&xb>=0)return 0;
	return check(x,y);
}
inline i128 slope(int x,int y){
	// y< x time
	if(tA[y]<=tA[x])return -2e18; 
	else if(tB[x]==tB[y])return 2e18;
	return (tA[y]-tA[x]-1)/(tB[x]-tB[y])+1;
}
inline bool ncmp(int x,int y){
	return tB[x]>tB[y];
}
inline i128 bcheck(i128 x,i128 y){
	bool flag=x<0;
	ll L=1,R=1e18+1e5,mn=2e18;
	while(L<=R){
		ll mid=L+R>>1;
		if((x+mid*y<0)!=flag)
			mn=min(mn,mid),R=mid-1;
		else L=mid+1;
	}
	return mn;
}
inline ll ccheck(ll L,ll R,int x,int y){
	ll mn=R+5;
	ga[x]=L*da[x]+a[x];
	gb[x]=L*db[x]+b[x];
	ga[y]=L*da[y]+a[y];
	gb[y]=L*db[y]+b[y];
	bool flag=check(x,y);
	while(L<=R){
		ll mid=L+R>>1;
		ga[x]=mid*da[x]+a[x];
		gb[x]=mid*db[x]+b[x];
		ga[y]=mid*da[y]+a[y];
		gb[y]=mid*db[y]+b[y];
		if(check(x,y)!=flag){
			mn=min(mn,mid);
			R=mid-1;
		}else{
			L=mid+1;
		}
	}
	return mn;
}
int main(){
//	freopen("yuanshen.in","r",stdin);
//	freopen("yuanshen.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;++i){
		ll A,DA,B,DB;cin>>A>>DA>>B>>DB;
		a[i]=A;da[i]=DA;b[i]=B;db[i]=DB;
	}
	vector<ll> pl;
	pl.push_back(0),pl.push_back(m+1);
	for(int i=1;i<=n;++i){
		ll mn=bcheck(b[i]-a[i],db[i]-da[i]);
		if(mn<=m)pl.push_back(mn);
	}
	for(int i=1;i<=n;++i){
		for(int j=i+1;j<=n;++j){
			int x=i,y=j;
			// 分段函数，分为三段， $[0,L] (L,R] (R,m]$ 首先搞出这个 L,R 然后在段内二分
			ll resA=bcheck(a[y]-b[x],da[y]-db[x]);// 满足 
			ll resB=bcheck(a[x]-b[y],da[x]-db[y]);
			if(resA>=0&&resA<=m)pl.push_back(resA),pl.push_back(resA+1);
			if(resB>=0&&resB<=m)pl.push_back(resB),pl.push_back(resB+1);
			ll tmpA=ccheck(0,min(resA,resB)-1,x,y);
			if(tmpA<=min({m,resA-1,resB-1}))pl.push_back(tmpA),pl.push_back(tmpA+1);
			ll tmpB=ccheck(min(resA,resB),max(resA,resB)-1,x,y);
			if(tmpB<=min(m,max(resA,resB)-1)&&tmpB>=min(resA,resB))pl.push_back(tmpB),pl.push_back(tmpB+1);
			ll tmpC=ccheck(max(resA,resB),m,x,y);
			if(tmpC>=max(resA,resB)&&tmpC<=m)pl.push_back(tmpC),pl.push_back(tmpC+1);
		}
	}
	sort(pl.begin(),pl.end());
	pl.erase(unique(pl.begin(),pl.end()),pl.end());
	ull ans=0;
	int sz=pl.size();
	for(int i=0;i+1<sz;++i){
		ll t=pl[i],nxt=pl[i+1];p[0]=0;
		for(int i=1;i<=n;++i)p[i]=i,ga[i]=a[i]+t*da[i],gb[i]=b[i]+t*db[i];
		sort(p+1,p+n+1,cmp);tA[0]=tB[0]=0;
		for(int i=1;i<=n;++i)
			tA[i]=tA[i-1]+b[p[i-1]]-a[p[i]],
			tB[i]=tB[i-1]+db[p[i-1]]-da[p[i]];
		for(int i=0;i<=n;++i)
			p[i]=i;
		sort(p,p+n+1,ncmp);
		for(int i=0;i<=n;++i)
			ttA[i]=tA[p[i]],
			ttB[i]=tB[p[i]];
		for(int i=0;i<=n;++i)
			tA[i]=ttA[i],
			tB[i]=ttB[i];
		int tp=0;stk[++tp]=0;
		for(int i=1;i<=n;++i){//
			while(tp&&(tA[i]<=tA[stk[tp]]||(tp>1&&slope(stk[tp-1],stk[tp])>slope(stk[tp],i))))tp--;
			stk[++tp]=i;
		}
		T[0]=t;
		for(int i=1;i<tp;++i){
			T[i]=max(T[i-1],(i128)slope(stk[i],stk[i+1]));
			T[i]=min(T[i],(i128)nxt);
		}T[tp]=nxt;

		for(int i=1;i<=tp;++i)
		if(T[i]>T[i-1]){
			ans-=tA[stk[i]]*(T[i]-T[i-1]);
			ull g=(i128)(T[i]+T[i-1]-1)*(T[i]-T[i-1])/2;
			ans-=tB[stk[i]]*g;
		}
	}
	cout<<ans<<'\n';
}