#include <bits/stdc++.h>
#ifdef LOCAL
#include "txm/debug.h"
#endif
using namespace std;
typedef long double ld;
typedef long long ll;
const int N=100005;
const ld eps=1e-6;
int n,D,d[N],x[N],nxt[N],p[N][17],s[N],ans;
ld V,v[N],t[N],pos[N];
bool iseq(ld x,ld y) {return fabs(x-y)<eps;}
ld ask(int a,ld tt)
{
	if(tt<t[a]) return x[a]+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-=t[y];
	return pos[y]+v[p[y][0]]*tt-(s[y]-s[a]);
}
signed main()
{
	int w,m;
	scanf("%d %d %d %d",&n,&D,&w,&m),V=(ld)w/m;
	for(int i=1;i<=n;i++)
	{
		scanf("%d %d %d %d",x+i,d+i,&w,&m);
		v[i]=(ld)w/m,s[i]=s[i-1]+d[i];
	}
	nxt[n]=n+1,t[n]=1e14,pos[n]=x[n];
	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]=1e14,pos[i]=x[i]; continue;}
		int to=nxt[i];
		ld tt=(x[to]-x[i]-(s[to]-s[i]))/(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=(x[k]-x[i]-(s[k]-s[i]))/(v[i]-v[k]);
				if(tt>t[k]||iseq(tt,t[k])) to=k;
			}
			to=p[to][0];
		}
		p[i][0]=to;
		t[i]=(x[to]-x[i]-(s[to]-s[i]))/(v[i]-v[to]);
		pos[i]=x[i]+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 l=0,r=1e14,mid,tt=0;
		while(!iseq(l,r))
		{
			mid=(l+r)/2;
			if(mid*V<ask(i,mid)-d[i]) tt=mid,l=mid;
			else r=mid;
		}
		ld L=ask(i,tt)-d[i]-ask(i-1,tt);
		if(i==1||L>D) ans++;
	}
	printf("%d",ans);
	return 0;
}
/*
3 1 10 1
2 1 5 1
8 1 4 1
10 1 2 1
*/