#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

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

    ll N, K, D;
    cin >> N >> K >> D;
    vector<ll> H(N);
    rep(i, N) cin >> H[i];

    vector<ll> Z = H;
    sort(all(Z));
    Z.erase(unique(all(Z)), Z.end());

    int L = Z.size();
    fenwick_tree<ll> cnt(L), acc(L);
    rep(i, K) {
        int idx = lower_bound(all(Z), H[i]) - Z.begin();
        cnt.add(idx, 1LL);
        acc.add(idx, H[i]);
    }

    auto f = [&](ll X) {
        ll cost = 0LL;

        // (X + D, INF)
        {
            int r = upper_bound(all(Z), X + D) - Z.begin();
            cost += acc.sum(r, L) - cnt.sum(r, L) * (X + D);
        }
        
        // [-INF, X)
        {
            int l = lower_bound(all(Z), X) - Z.begin();
            cost += cnt.sum(0, l) * X - acc.sum(0, l);
        }

        return cost;
    };

    ll ans = LINF;
    FOR(i, K, N + 1) {
        
        ll ok = 0, ng = 1LL << 30;
        while(abs(ok - ng) > 1LL){
            ll mid = (ok + ng) >> 1LL;
            int l = lower_bound(all(Z), mid) - Z.begin();
            int r = upper_bound(all(Z), mid + D) - Z.begin();
            (cnt.sum(r, L) >= cnt.sum(0, l) ? ok : ng) = mid;
        }

        chmin(ans, f(ok));
        chmin(ans, f(ok + 1));

        if(i == N) break;

        {
            int idx = lower_bound(all(Z), H[i - K]) - Z.begin();
            cnt.add(idx, -1LL);
            acc.add(idx, -H[i - K]);
        }
        {
            int idx = lower_bound(all(Z), H[i]) - Z.begin();
            cnt.add(idx, 1LL);
            acc.add(idx, H[i]);
        }
    }

    cout << ans << endl;
}