#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;

class UnionFind {
public:
    vector<int> uni;
    UnionFind(int s) : uni(s, -1) {}
    int root(int a) {
        return uni[a] < 0 ? a : uni[a] = root(uni[a]);
    }
    bool connect(int a, int b) {
        a = root(a);
        b = root(b);
        if(a == b) return false;
        if(uni[a] > uni[b]) swap(a, b);
        uni[a] = uni[a] + uni[b];
        uni[b] = a;
        return true;
    }
    bool isConnect(int a, int b) {
        return root(a) == root(b);
    }
    int size(int a) {
        return -uni[root(a)];
    }
};

int main() {
    int N, A, B;
    cin >> N >> A >> B;
    vector<int> X(N);
    map<int, int> id;
    rep(i, N) {
        cin >> X[i];
        id[X[i]] = i;
        id[-X[i]] = i;
    }
    for(auto &e : X) cin >> e;
    UnionFind uf(N);
    vector<pair<int, int>> ranges;
    rep(_, 2) {
        for(auto &x : X) {
            auto it = lower_bound(X.begin(), X.end(), x + A);
            auto jt = upper_bound(X.begin(), X.end(), x + B);
            if(it == X.end()) continue;
            if(jt == X.begin()) continue;
            jt = prev(jt);
            if(*it > x + B || *jt < x + A) continue;
            int i = id[*it];
            int j = id[*jt];
            if(i > j) swap(i, j);
            ranges.emplace_back(i, j);
            uf.connect(id[x], i);
            uf.connect(id[x], j);
        }
        for(auto &x : X) x = -x;
        sort(X.begin(), X.end());
    }
    vector<int> R(N + 2);
    for(auto &[i, j] : ranges) {
        R[i]++, R[j]--;
    }
    rep(i, N + 1) R[i + 1] += R[i];
    rep(i, N - 1) if(R[i]) uf.connect(i, i + 1);
    rep(i, N) cout << uf.size(i) << '\n';
    return 0;
}