#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 lb = 0, ub = a.back() + 1;
  while (ub - lb > 1) {
    const ll mid = midpoint(lb, ub);
    int le = 0, ri = n - 1;
    while (le < n && a[le] < mid) ++le;
    while (ri >= 0 && a[ri] > mid + u) --ri;
    (le <= n - 1 - ri ? lb : ub) = mid;
  }
  ll x = max(lb - k, 0LL), cost = 0;
  vector<int> add_l(k, 0), add_r(k, 0);
  REP(i, n) {
    if (a[i] < x) {
      cost += (x - a[i] + k - 1) / k;
      ++add_l[a[i] % k];
    } else if (x + u < a[i]) {
      cost += (a[i] - (x + u) + k - 1) / k;
      ++add_r[a[i] % k];
    }
  }
  // REP(i, n) cout << a[i] << " \n"[i + 1 == n];
  unordered_map<ll, int> mp;
  REP(i, n) ++mp[a[i]];
  ll ans = LINF;
  for (; x <= lb + k; ++x) {
    // cout << '[' << x << ',' << x + u << "] " << cost << '\n';
    // REP(i, n) {
    //   if (a[i] < x) {
    //     cout << (x - a[i] + k - 1) / k;
    //   } else if (x <= a[i] && a[i] <= x + u) {
    //     cout << 0;
    //   } else {
    //     cout << (a[i] - (x + u) + k - 1) / k;
    //   }
    //   cout << " \n"[i + 1 == n];
    // }
    chmin(ans, cost);
    cost += add_l[x % k];
    if (const auto it = mp.find(x); it != mp.end()) {
      cost += it->second;
      add_l[x % k] += it->second;
    }
    cost -= add_r[(x + u + 1) % k];
    if (const auto it = mp.find(x + u + 1); it != mp.end()) {
      add_r[(x + u + 1) % k] -= it->second;
    }
  }
  cout << ans << '\n';
  return 0;
}