#include <bits/stdc++.h>
using namespace std;
#define V vector
#define all0(x) (x).begin(),(x).end()
#define all1(x) (x).begin()+1,(x).end()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define cin std::cin
#define cout std::cout
typedef long long LL;
typedef pair<int, int> pi;
typedef pair<LL, LL> pl;

//const int MN = 2e5 + 20;
const int INF = 2e9 + 1000;
const LL INFLL = 8e18 + 1000;
mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());
//模板区域~~~~~~~

//模板结束~~~~~~~

int rnd(int l, int r) {
    return mrand() % (r - l + 1) + l;
}

void solve() {
    int n; cin >> n;
    LL k, T; cin >> k >> T;
    // int n = 10;
    // LL k = mrand() % 10 + 1, T = mrand() % 100 + 10;
    // cout << "n, k, T : " << n << " " << k << " " << T << endl;
    V<LL> pos(1), neg(1);
    for(int i = 1; i <= n; i++) {
        LL t; cin >> t;
        // LL t = rnd(-(T - k) / 2, (T - k) / 2);
        // cout << t << " ";
        if(t >= 0) pos.pb(t);
        else neg.pb(-t);
    }
    // cout << endl;
    n = pos.size() - 1;
    int m = neg.size() - 1;
    sort(all1(pos));
    sort(all1(neg));

    V<V<int>> dp(n + 1, V<int>(m + 1, INF / 2));
    auto show = [&]() -> void {
        for(int l = 0; l <= n; l++) {
            for(int r = 0; r <= m; r++) {
                cout << dp[l][r] << " ";
            }
            cout << endl;
        }
    };

    dp[0][0] = 0;

    auto amt = [&](int l, int r) -> LL {
        return (T - pos[l] * 2 - neg[r] * 2) / k;
    };
    
    for(int l = 0; l <= n; l++) {
        for(int r = 0; r <= m; r++) {
            if(l + r <= amt(l, r) && (l || r)) {
                dp[l][r] = 1;
            }
        }
    }

    auto upd_dp_by_side = [&](int l, int r) -> void {
        dp[l][r] = min(dp[l][r], dp[max(0LL, l - amt(l, 0))][r] + 1);
        dp[l][r] = min(dp[l][r], dp[l][max(0LL, r - amt(0, r))] + 1);
    };

    // show();

    deque<int> dque;
    auto add = [&](int x) -> void {
        while(dque.size() && dque.back() > x) dque.pop_back();
        dque.push_back(x);
    };
    auto del = [&](int x) -> void {
        if(dque.front() == x) dque.pop_front();
    };

    for(int in_len = 1; in_len <= n + m - 2; in_len++) {
        dque.clear();
        int r = 0;
        int rr = min(in_len, n) + 1, ll = min(in_len, n);
        for(int l = n; l >= 0; l--) {
            if(l + r - amt(l, r) > in_len) continue;
            while(r + 1 <= m && l + r + 1 - amt(l, r + 1) <= in_len) r++;
            if(amt(l, r) >= 2 && l + r - amt(l, r) == in_len && l && r) {
                // cout << "l, r, in_len" << l << " " << r << " " << in_len << endl;
                while(rr - 1 >= max(in_len + 1 - r, 0)) {
                    rr--;
                    add(dp[rr][in_len - rr]);
                }
                while(ll > min(in_len, l - 1)) {
                    del(dp[ll][in_len - ll]);
                    ll--;
                }
                assert(min(in_len, l - 1) >= max(in_len + 1 - r, 0));
                // cout << "ll, rr" << ll << " " << rr << endl;
                dp[l][r] = min(dp[l][r], dque.front() + 1);
                upd_dp_by_side(l, r);
            }
        }
    }

    // show();

    for(int l = 0; l <= n; l++) {
        for(int r = 0; r <= m; r++) {
            if(dp[l][r] == INF / 2) upd_dp_by_side(l, r);
        }
    }

    cout << dp[n][m] << endl;
}

int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;   
    while (t--) 
    solve();
}