#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const double eps=1e-5;
const int N=1e5+101;
int n;
int L,R,Y;
struct scl{
	int x,d;
	bool operator<(scl oth){
		return x<oth.x;
	}
};
vector<scl> a;
int cnt[N];
int main(){
	scanf("%d%d%d%d",&n,&L,&R,&Y);
	for(int i=1;i<=n;i++){
		int x,v,h;
		scanf("%d%d%d",&x,&v,&h);
//		printf("%.20lf\n",1.0*Y/v*h-eps);
		int rad=int(1.0*Y/v*h-eps);
		int lb=x-rad,rb=x+rad;
//		printf("%d %d\n",lb,rb);
		if(lb>=L) a.push_back((scl){lb,1});
		if(rb<R)  a.push_back((scl){rb+1,-1});
	}
	sort(a.begin(),a.end());
	int cur=0;
	int lst=L;
	for(auto p:a){
		cnt[cur]+=p.x-lst;
		cur+=p.d;
		lst=p.x;
	}
	cnt[cur]+=R+1-lst;
	for(int i=0;i<=n;i++){
		if(i) cnt[i]+=cnt[i-1];
		printf("%d\n",cnt[i]);
	}
}
/*
3
-7 7 3
0 2 3
-4 2 1
3 3 1
*/