#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

ll f(ll x,ll y){
    if(x<=0) return 0;
    return (x+y-1)/y;
}

ll g(ll x,ll y,ll z){
    ll ok=(z-x)/y-100,ng=(z-x)/y+100;
    while(ng-ok>1){
        ll mid=(ok+ng)/2;
        if(x+mid*y<z) ok=mid;
        else ng=mid;
    }
    return x+ng*y;
}

int main() {
    ll N,K,L,U;
    cin >> N >> K >> L >> U;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];
    ll ok=-1,ng=1e12+500;
    while(ng-ok>1){
        ll x=(ok+ng)/2;
        ll a=0,b=0;
        rep(i,N){
            if(A[i]<x) a++;
            if(x+U-L<A[i]) b++;
        }
        if(a<=b) ok=x;
        else ng=x;
    }
    ll now=0;
    ll l=ok-K+1;
    ll u=l+U-L;
    rep(i,N){
        now+=max((ll)0,f(l-A[i],K));
        now+=max((ll)0,f(A[i]-u,K));
    }
    ll ans=now;
    vector<ll> cum(K*2-1,0);
    rep(i,N){
        ll xl=(A[i]+1)%K;
        ll minl=g(xl,K,max(A[i],ok-K+2));
        while(minl<=ok+K) cum[minl-(ok-K+2)]++,minl+=K;
        ll xu=(A[i]+L+K-U%K)%K;
        ll minu=g(xu,K,ok-K+2);
        while(minu<=ok+K){
            if(minu+U-L<=A[i]) cum[minu-(ok-K+2)]--;
            minu+=K;
        }    
    }
    rep(i,K*2-1){
        now+=cum[i];
        ans=min(ans,now);
    }
    cout << ans << endl;
    return 0;
}