#include using namespace std; #define reps(i,s,n) for(int i = s; i < n; i++) #define rep(i,n) reps(i,0,n) #define Rreps(i,n,e) for(int i = n - 1; i >= e; --i) #define Rrep(i,n) Rreps(i,n,0) #define ALL(a) a.begin(), a.end() #define fi first #define se second typedef long long ll; typedef vector vec; typedef vector mat; ll N,M,H,W,Q,K,A,B; string S; //const ll MOD = 998244353; const ll MOD = (1e+9) + 7; typedef pair P; const ll INF = (1LL<<58); int main(){ class union_find{ vector parent, tree_size; public: union_find(unsigned long _n) : parent(_n), tree_size(_n, 1){ for(unsigned long i = 0; i < _n; ++i)parent[i] = i; } ll find(ll x){ while(parent[x] != x)x = parent[x] = parent[parent[x]]; return x; } void merge(ll a, ll b){ a = find(a); b = find(b); if(a==b) return; if(tree_size[a] < tree_size[b])swap(a, b); tree_size[a] += tree_size[b]; parent[b] = a; return; } bool same(ll a, ll b){ a = find(a); b = find(b); return a == b; } ll get_size(ll a){ return tree_size[find(a)]; } }; //uf.mergeのように使う //ufはMAX_N+1でとるか、代入時に0-indexedにする cin>>N>>A>>B; union_find uf(N + 10); vec a(N); rep(i,N) cin>>a[i]; a.push_back(ll(3e+9)); set valid; rep(i,N + 1) valid.insert(i); int l = 0; auto ite_r = valid.begin(); ++ite_r; auto last = ite_r; while(l < N){ if(a[*ite_r] - a[l] < A){ last = ++ite_r; }else if(a[*ite_r] - a[l] <= B){ uf.merge(l, *ite_r); if(last != ite_r) valid.erase(last); last = ite_r++; }else{ ++l; ite_r = valid.lower_bound(l + 1); last = ite_r; } } rep(i,N){ cout<