#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, k; ll l, u; cin >> n >> k >> l >> u;
  u -= l;
  vector<ll> a(n);
  for (ll& a_i : a) cin >> a_i;
  ranges::sort(a);
  for (int i = n - 1; i >= 0; --i) {
    a[i] -= a.front();
  }
  ll ans = LINF;
  REP(l, n) {
    const int r = distance(a.begin(), prev(ranges::upper_bound(a, a[l] + u)));
    if (abs(l - (n - 1 - r)) > 1) continue;
    ll x = max(a[r] - u, l == 0 ? 0 : a[l - 1] + 1), cost = 0;
    vector<int> add_l(k, 0), add_r(k, 0);
    REP(i, l) {
      cost += (x - a[i] + k - 1) / k;
      ++add_l[a[i] % k];
    }
    FOR(i, r + 1, n) {
      cost += (a[i] - (x + u) + k - 1) / k;
      ++add_r[a[i] % k];
    }
    for (; x <= a[l]; ++x) {
      chmin(ans, cost);
      cost += add_l[x % k];
      cost -= add_r[(x + 1) % k];
    }
  }
  cout << ans << '\n';
  return 0;
}