#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define ll long long

using namespace std;

vector < int > d1, d2;
vector < pair < int, int > > mem;
int st = 0;

int find_max(int v, int l, int r, int cl, int cr) {
    if (cl >= r || cr <= l) return -1e9;
    if (cl >= l && cr <= r) return d1[v];
    int mid = (cl + cr) / 2;
    return max(find_max(v * 2, l, r, cl, mid), find_max(v * 2 + 1, l, r, mid, cr));
}

int find_min(int v, int l, int r, int cl, int cr) {
    if (cl >= r || cr <= l) return 1e9;
    if (cl >= l && cr <= r) return d2[v];
    int mid = (cl + cr) / 2;
    return min(find_min(v * 2, l, r, cl, mid), find_min(v * 2 + 1, l, r, mid, cr));
}

pair < int, int > kek(int v, int l, int r, int cl, int cr) {
    if (cl >= r || cr <= l) return {1e9, 0};
    if (cl >= l && cr <= r) return mem[v];
    int mid = (cl + cr) / 2;
    pair < int, int > zn1 = kek(v * 2, l, r, cl, mid), zn2 = kek(v * 2 + 1, l, r, mid, cr);
    if (zn1.F < zn2.F) return zn1;
    return zn2;
}

void upd(int v) {
    v += (1 << st);
    v /= 2;
    while (v > 0) {
        if (mem[v * 2].F < mem[v * 2 + 1].F) mem[v].S = mem[v * 2].S;
        else mem[v].S = mem[v * 2 + 1].S;
        mem[v].F = min(mem[v * 2].F, mem[v * 2 + 1].F);
        v /= 2;
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#ifdef LOCAL
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
#else
//    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif
    //YA IZVINYAUS
    int n, s, l;
    cin >> n >> s >> l;
    while (1 << st < n)
        ++st;
    d1.resize(1 << (st + 1), -1e9);
    d2.resize(1 << (st + 1), 1e9);
    mem.resize(1 << (st + 1), {1e9, 0});
    vector < int > f(n, 0);
    int a[n];
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        d1[(1 << st) + i] = a[i];
        d2[(1 << st) + i] = a[i];
    }
    for (int i = (1 << st) - 1; i > 0; --i) {
        d1[i] = max(d1[i * 2], d1[i * 2 + 1]);
        d2[i] = min(d2[i * 2], d2[i * 2 + 1]);
    }
    for (int i = 0; i < n; ++i) {
        if (i > 0) f[i] = f[i - 1];
        while (find_max(1, f[i], i + 1, 0, 1 << st) - find_min(1, f[i], i + 1, 0, 1 << st) > s)
            ++f[i];
    }
    vector < int > dp(n, 1e9);
    for (int i = 0; i < n; ++i) {
        int l = f[i], r = i - l;
        if (f[i] == 0) {
            dp[i] = 1;
            upd(i);
            continue;
        }
        r = max(r, 0);
        if (l > r) swap(l, r);
        int j = kek(1, l, r + 1, 0, 1 << st).S;
        dp[i] = dp[j] + 1;
    }
    for (int i = 0; i < n; ++i)
        cout << dp[i] << ' ';
    return 0;
    if (dp[n - 1] >= 1e9) dp[n - 1] = -1;
    cout << dp[n - 1];
    return 0;
}