#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/segtree>
struct F{
    ll sum = 0;
    ll c = 0;
};

F op(F l, F r){
    l.sum += r.sum;
    l.c += r.c;
    return l;
}
F e(){return F{};}

void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, K, D;
    cin >> N >> K >> D;
    vector<ll> H(N);
    rep(i, 0, N) cin >> H[i];
    vector<int> order(N);
    rep(i, 0, N) order[i] = i;
    sort(all(order), [&](int l, int r){
        return H[l] < H[r];
    });
    vector<int> inv(N);
    auto A = H;
    So(A);
    rep(i, 0, N) inv[order[i]] = i;
    atcoder::segtree<F, op, e> seg(N);
    rep(i, 0, K){
        seg.set(inv[i], {H[i], 1});
    }
    ll ans = ILL;
    auto f = [&](ll m) -> pair<F, F> {
        int a = LB(A, m);
        pair<F, F> res;
        res.first = seg.prod(0, a);
        a = UB(A, m + D);
        res.second = seg.prod(a, N);
        return res;
    };
    rep(i, K, N + 1){

        ll l = -1, r = INF;
        while (r - l > 1){
            ll m = (l + r) / 2;
            auto [a, b] = f(m);
            if (a.c < b.c) l = m;
            else r = m;
        }
        auto [a, b] = f(r);
        ll tmp = 0;
        tmp += a.c * r - a.sum;
        tmp += b.sum - b.c * (r + D);
        cerr << r << " " << tmp << "\n";
        chmin(ans, tmp);
        if (i == N) break;
        seg.set(inv[i - K], e());
        seg.set(inv[i], {H[i], 1});
    }
    cout << ans << "\n";
}