#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, t, x, y;
    cin >> n >> t >> x >> y;
    vector<ll> a(n);
    for(auto &&v : a) cin >> v;
    sort(a.begin(), a.end());
    vector<int> cnt;
    for(int i = 0; i < n; ){
        int p = i;
        while(i < n && a[i] <= a[max(p, i - 1)] + t) i++;
        cnt.emplace_back(i - p);
    }
    sort(cnt.rbegin(), cnt.rend());
    vector<int> ans(n);
    int sv = 0;
    for(auto &&v : cnt){
        sv += v;
        if(sv != n) ans[sv]++;
    }
    int mx = 0;
    for(int i = 0; i < n; i++){
        mx += ans[i];
        cout << mx << " \n"[i == n - 1];
    }
}