#include <bits/stdc++.h>
#ifdef LOCAL
#include "txm/debug.h"
#endif
using namespace std;
typedef long long ll;
const int N=100005;
struct frac
{
	__int128 a,b;
	frac operator + (const frac &x)const
	{
		__int128 aa=b*x.a+a*x.b,bb=b*x.b,g=__gcd(aa,bb);
		return (frac){aa/g,bb/g};
	}
	frac operator - (const frac &x)const
	{
		__int128 aa=a*x.b-b*x.a,bb=b*x.b,g=__gcd(aa,bb);
		return (frac){aa/g,bb/g};
	}
	frac operator * (const frac &x)const 
	{
//		cerr<<"! "<<(int)a<<" "<<(int)b<<'\n';
		__int128 aa=a*x.a,bb=b*x.b,g=__gcd(aa,bb);
		return (frac){aa/g,bb/g};
	}
	frac operator / (const frac &x)const 
	{
//		cerr<<"! "<<(int)x.a<<" "<<(int)x.b<<'\n';
		return (frac){a,b}*(frac){x.b,x.a};
	}
	bool operator > (const frac &x)const
	{
		return a*x.b>b*x.a;
	}
	bool operator < (const frac &x)const
	{
		return a*x.b<b*x.a;
	}
	bool operator == (const frac &x)const
	{
		return a*x.b==b*x.a;
	}
	void Debug() {cerr<<"Debug "<<(int)a<<" "<<(int)b<<'\n';}
};
typedef frac ld;
int n,D,d[N],x[N],nxt[N],p[N][17],ans;
ld V,v[N],t[N],pos[N];
ll s[N];
bool iseq(ld x,ld y) {return x==y;}
ld ask(int a,ld tt)
{
	if(tt<t[a]) return (frac){x[a],1}+v[a]*tt;
	int y=a;
	for(int i=16;i>=0;i--)
		if(p[y][i]&&(tt>t[p[y][i]]||iseq(t[p[y][i]],tt))) y=p[y][i];
	tt=tt-t[y];
	return pos[y]+v[p[y][0]]*tt-(frac){s[y]-s[a],1};
}
signed main()
{
//	freopen("1.in","r",stdin);
//	freopen("1.ans","w",stdout);
	int w,m;
	scanf("%d %d %d %d",&n,&D,&w,&m),V=(frac){w,m};
	for(int i=1;i<=n;i++)
	{
		scanf("%d %d %d %d",x+i,d+i,&w,&m);
		v[i]=(frac){w,m},s[i]=s[i-1]+d[i];
	}
	nxt[n]=n+1,t[n]=(frac){(__int128)1e19,1},pos[n]=(frac){x[n],1};
	for(int i=n-1;i>=1;i--)
	{
		nxt[i]=i+1;
		while(nxt[i]<=n&&(v[i]<v[nxt[i]]||iseq(v[i],v[nxt[i]]))) nxt[i]=nxt[nxt[i]];
		if(nxt[i]>n) {t[i]=(frac){(__int128)1e19,1},pos[i]=(frac){x[i],1}; continue;}
		int to=nxt[i];
		ld tt=(frac){x[to]-x[i]-(s[to]-s[i]),1}/(v[i]-v[to]);
		if(tt>t[to]||iseq(tt,t[to]))
		{
			for(int j=16;j>=0;j--)
			{
				int k=p[nxt[i]][j];
				if(!k) continue;
				tt=(frac){x[k]-x[i]-(s[k]-s[i]),1}/(v[i]-v[k]);
				if(tt>t[k]||iseq(tt,t[k])) to=k;
			}
			to=p[to][0];
		}
		p[i][0]=to;
		t[i]=(frac){x[to]-x[i]-(s[to]-s[i]),1}/(v[i]-v[to]);
		pos[i]=(frac){x[i],1}+v[i]*t[i];
		for(int j=1;1<<j<=n;j++) p[i][j]=p[p[i][j-1]][j-1];
	}
	for(int i=1;i<=n;i++)
	{
		ld tt;
		int j=i;
		if(V*t[i]>(frac){x[i]-d[i],1}) tt=(frac){x[i]-d[i],1}/(V-v[i]);
		else
		{
			for(int k=16;k>=0;k--)
			{
				int fa=p[j][k];
				if(!fa||t[fa]==(frac){(__int128)1e19,1}) continue;
				if(V*t[fa]<pos[fa]-(frac){s[fa]-s[i],1}) j=fa;
			}
			j=p[j][0];
			tt=(frac){x[j]-(s[j]-s[i-1]),1}/(V-v[j]);
		}
		ld L=ask(i,tt)-(frac){d[i],1}-ask(i-1,tt);
		if(i==1||L>(frac){D,1}||iseq((frac){D,1},L)) ans++;
	}
	printf("%d",ans);
	return 0;
}