#include "bits/stdc++.h" #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector veci; typedef vector vecll; typedef vector vecs; template using Hash=unordered_map; #define REP(i, a, n) for(ll i = a; i < n; i++) #define RREP(i, a, n) for(ll i = n-1; i >= a; i--) #define rep(i, n) REP(i, 0, n) #define rrep(i, n) RREP(i, 0, n) #define MD 1000000007 template T read(){T a;cin >> a;return a;} template void read(T& a){cin >> a;} template void read(T& a, Args&... args){cin >> a; read(args...);} template void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}} template void write(T a){cout << setprecision(12) << a << endl;} template void write(T a, Args... args){cout << setprecision(12) << a << c; write(args...);} template void warr(vector a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;} template void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;} void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}} void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}} ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}} ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;} struct UnionFind { vector data; UnionFind(int size_) : data(size_, -1) { } bool unionSet(int x, int y) { x = root(x); y = root(y); if (x != y) { if (data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x; } return x != y; } bool findSet(int x, int y) { return root(x) == root(y); } int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); } int size(int x) { return -data[root(x)]; } }; int main(void) { int n,a,b; read(n,a,b); int x[(int)3e5]={0}; bool find[(int)3e5]={0}; rep(i,n)read(x[i]); UnionFind uf(n); rep(i,n){ if(find[i])continue; auto it=lower_bound(&x[i],&x[n-1],x[i]+a); if(it==&x[n]){ continue; } int ii=it-&x[0]; int j=i; while(ii=a&&x[ii]-x[i]<=b){ uf.unionSet(j,ii); find[j]=true; j=ii++; } } rep(i,n){ write(uf.size(i)); } return 0; }