#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,D,x[N],dd[N],ans=1;
long long sum[N];
__float128 V,v[N],k[N],b[N],d[N],T1[N],T2[N];
int zhan[N],top;
__float128 readV()
{
	int x,y;
	cin>>x>>y;
	return (__float128)x/y;
}
__float128 calc(__float128 k1,__float128 b1,__float128 k2,__float128 b2)
{
	return (b2-b1)/(k1-k2);
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>D,V=readV();
	for(int i=1;i<=n;i++)cin>>x[i]>>dd[i],v[i]=readV(),sum[i]=sum[i-1]+dd[i];
	for(int i=1;i<=n;i++)k[i]=v[i],b[i]=x[i]-sum[i];
	d[1]=1e18;
	for(int i=n;i;i--)
	{
		while(top&&(k[zhan[top]]>=k[i]||calc(k[zhan[top]],b[zhan[top]],k[i],b[i])>=d[top]))top--;
		zhan[++top]=i;
		if(top!=1)d[top]=calc(k[zhan[top]],b[zhan[top]],k[zhan[top-1]],b[zhan[top-1]]);
		__float128 K=V,B=b[i]-(x[i]+D);
		int l=1,r=top;
		while(l<=r)
		{
			int mid=(l+r)/2;
			if(K*d[mid]+B>=k[zhan[mid]]*d[mid]+b[zhan[mid]])l=mid+1;
			else r=mid-1;
		}
		T1[i]=calc(K,B,k[zhan[r]],b[zhan[r]]);
		B=b[i]-(x[i]-dd[i]);
		l=1,r=top;
		while(l<=r)
		{
			int mid=(l+r)/2;
			if(K*d[mid]+B>=k[zhan[mid]]*d[mid]+b[zhan[mid]])l=mid+1;
			else r=mid-1;
		}
		T2[i]=calc(K,B,k[zhan[r]],b[zhan[r]]);
	}
	for(int i=1;i<n;i++)if(T1[i]<=T2[i+1])ans++;
	cout<<ans;
	return 0;
}