#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define INF 1000000001LL
#define LNF 1000000000000000001LL
#define MOD 1000000007LL
#define MAX 300001
#define long long long
#define all(x) x.begin(),x.end()
using namespace std;

class UnionFind
{
public:
    vector<int> parent;
    vector<int> cnt;
    int n;

    void init(int size)
    {
        n = size;
        parent = vector<int>(n);
        cnt = vector<int>(n);
        for(int i = 0; i<n; i++)
        {
            parent[i] = i;
            cnt[i] = 1;
        }
    }

    int find(int x)
    {
        if(x == parent[x])
            return x;
        return parent[x] = find(parent[x]);
    }

    void merge(int x, int y)
    {
        x = find(x);
        y = find(y);

        if(x == y)
            return;
        
        if(x < y)
        {
            parent[y] = x;
            cnt[x]+=cnt[y];
        }
        else
        {
            parent[x] = y;
            cnt[y]+=cnt[x];
        }
    }
};
int main()
{
	ios_base::sync_with_stdio(0); 
    cin.tie(0);


    int n,a,b;
    cin >> n >> a >> b;

    vector<int> arr(n);

    for(int i = 0; i<n; i++)
        cin >> arr[i];

    UnionFind uf;
    uf.init(n);
    vector<int> cnt(n+1);
    for(int i = 0; i<n; i++)
    {
        int left = lower_bound(all(arr),arr[i]+a)-arr.begin();
        int right = upper_bound(all(arr),arr[i]+b)-arr.begin();
        if(left == right)
            continue;
        uf.merge(i,left);
        uf.merge(i,right-1);
        cnt[left]++;
        cnt[right-1]--;
    }

    int p = 0;
    for(int i = 0; i<n-1; i++)
    {
        p+=cnt[i];
        if(p)
            uf.merge(i,i+1);
    }
    for(int i = 0; i<n; i++)
        cout << uf.cnt[uf.find(i)] << "\n";

    return 0;
}