#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
#define f first
#define s second
#define ll long long
#define pb push_back
#define pi pair <ll,ll>
#define vi vector <ll>
#define size(x) (int)(x).size()
#define all(x) x.begin(), x.end()
void setIO(string name = "") {
	cin.tie(0)->sync_with_stdio(0);
	if (size(name)) {
		freopen((name + ".in").c_str(), "r", stdin);
		freopen((name + ".out").c_str(), "w", stdout);
	}
}

ll N, L, R, Y;
vector <pi> ranges;

int main()
{
	setIO();
	
	cin >> N >> L >> R >> Y;
	for (int i = 0; i < N; i++) {
		ll x, v, h;
		cin >> x >> v >> h;
		ll l = floor(x - (double) h / v * Y);
		ll r = ceil(x + (double) h / v * Y);
		//if l = 1 , r =5,push {2,5}, inlude 2 3 4 which is 5-2
		//if l = 1 , r =5.2,push {2,6}, inlude 2 3 4  5 which is 6-2
		//cout << l << " " << r << '\n';
		
		ranges.pb({l + 1, 1});//include
		ranges.pb({r, -1});//no include
		
	/*	int x, v, h;
		cin >> x >> v >> h;
		double l = x - (double) h / v * Y;
		double r = x + (double) h / v * Y;
		ranges.pb({floor(l) + 1, 1});
		ranges.pb({ceil(r), -1});	*/	
	}
	
	vi ans(N + 1, 0);
	ranges.pb({L, 0});
	ranges.pb({R + 1, 0});
	sort(ranges.begin(), ranges.end());
	int cur = 0;
	
	for (int i = 0; i < size(ranges); i++) {
		if (i > 0)
 		{
			pi u = ranges[i];
			pi v = ranges[i - 1];
			//if u.f is 5, v.f is 2, should have point 2 3 4
			// if R is 3? should be 2,3 === R+1-2
			// if L is 3, should be 3 4 === 5 - max(3,2) = 2
			if(u.f == L) ans[cur] += 1; 
			else if (i > 0 && u.f >= L && v.f <= R) ans[cur] += (min(R + 1, u.f) - max(L, v.f));
		}
		cur += ranges[i].s;
	}
	
	for (int i = 1; i <= N; i++)
		ans[i] += ans[i - 1];
	for (int i = 0; i <= N; i++) 
		cout << ans[i] << '\n';
	return 0;                    
}