#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,D,x[N],d[N],ans=1;
double V,v[N],tree[4*N],tag[4*N],T1[N],T2[N];
double readV()
{
	int x,y;
	cin>>x>>y;
	return 1.0*x/y;
}
void pushdown(int x)
{
	tree[x<<1]+=tag[x],tree[x<<1|1]+=tag[x];
	tag[x<<1]+=tag[x],tag[x<<1|1]+=tag[x];
	tag[x]=0;
}
void change(int x,int L,int R,int pos,long double t)
{
	if(L==R)return tree[x]=t,void();
	pushdown(x);
	int mid=(L+R)/2;
	if(pos<=mid)change(x<<1,L,mid,pos,t);
	else change(x<<1|1,mid+1,R,pos,t);
	tree[x]=min(tree[x<<1],tree[x<<1|1]);
}
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]>>d[i],v[i]=readV();
	for(int i=1;i<=4*n;i++)tree[i]=1e18;
	for(int i=n;i;i--)
	{
		if(i!=n)tag[1]-=d[i+1]/V;
		double t=(x[i]+D)/(V-v[i]);
		change(1,1,n,i,t),T1[i]=tree[1];
	}
	for(int i=1;i<=4*n;i++)tree[i]=1e18,tag[i]=0;
	for(int i=n;i;i--)
	{
		if(i!=n)tag[1]-=d[i]/V;
		double t=(x[i]-d[i])/(V-v[i]);
		change(1,1,n,i,t),T2[i]=tree[1];
	}
	for(int i=1;i<n;i++)if(T2[i+1]-T1[i]>=-1e-6)ans++;
	cout<<ans;
	return 0;
}