/*
    author:  Maksim1744
    created: 28.10.2023 12:29:37
*/

#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T> &v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T> &v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T> &v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>  v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> pair<T,U>& operator--           (pair<T, U> &p){--p.first; --p.second;            return  p;}
template<typename T, typename U> pair<T,U>& operator++           (pair<T, U> &p){++p.first; ++p.second;            return  p;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U> &p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>  p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define SHOW_COLORS
#include "/mnt/c/Libs/tools/print.cpp"
#else
#define show(...) void(0)
#define debugf(fun)   fun
#define debugv(var)   var
#define mclock    void(0)
#define shows     void(0)
#define debug  if (false)
#define OSTREAM(...)    ;
#define OSTREAM0(...)   ;
#endif

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int n;
    ll k, t;
    cin >> n >> k >> t;
    vector<ll> v(n);
    cin >> v;
    v.pb(0);
    sort(v.begin(), v.end());
    ++n;
    int hotel = find(v.begin(), v.end(), 0) - v.begin();

    show(v);
    show(hotel);

    const ll inf = 2e18;
    vector<pair<pair<ll, ll>, pair<ll, ll>>> dp(1, mp(mp(0, -v[0] * 2), mp(0, v.back() * 2)));
    vector<pair<pair<ll, ll>, pair<ll, ll>>> nx;

    auto update = [&](pair<ll, ll>& p, const pair<ll, ll>& o) {
        p = min(p, o);
    };

    auto add = [&](const pair<ll, ll>& p, ll tm) {
        if (p.second + tm > t) {
            return mp(inf, inf);
        } else {
            return mp(p.first, p.second + tm);
        }
    };

    for (int len = n - 1; len >= 1; --len) {
        shows;
        show(len);
        nx.assign(n - len + 1, mp(mp(inf, inf), mp(inf, inf)));
        for (int l = 0; l <= hotel; ++l) {
            if (l + (len + 1) > n) break;
            if (l + len < hotel) continue;
            if (l + len - 1 >= hotel) {
                update(nx[l].second, add(dp[l].second, k));
                if (dp[l].second.second + k > t) {
                    update(nx[l].second, mp(dp[l].second.first + 1, abs(v[l + len]) * 2 + k));
                }
            }
            if (l < hotel) {
                update(nx[l + 1].first, add(dp[l].first, k));
                if (dp[l].first.second + k > t) {
                    update(nx[l + 1].first, mp(dp[l].first.first + 1, abs(v[l]) * 2 + k));
                }
            }
        }

        show(nx);

        for (int i = 0; i < nx.size(); ++i) {
            if (nx[i].first.second + abs(v[i + len - 1]) * 2 <= t) {
                update(nx[i].second, add(nx[i].first, abs(v[i + len - 1]) * 2));
            } else {
                update(nx[i].second, mp(nx[i].first.first + 1, abs(v[i + len - 1]) * 2));
            }
            if (nx[i].second.second + abs(v[i]) * 2 <= t) {
                update(nx[i].first, add(nx[i].second, abs(v[i]) * 2));
            } else {
                update(nx[i].first, mp(nx[i].second.first + 1, abs(v[i]) * 2));
            }
        }

        swap(dp, nx);

        show(dp);
    }

    show(dp[hotel]);

    cout << dp[hotel].first.first + (dp[hotel].first.second > 0) << '\n';

    return 0;
}