#include <bits/stdc++.h>
using namespace std;
long long int invmod(long long int x, long long int n, long long int mod) {
  if (n == 0) return 1 % mod;
  long long int half = invmod(x, n / 2, mod);
  half = (half * half) % mod;
  if (n % 2 == 1) half = (half * (x % mod)) % mod;
  return half;
}
long long int bin(long long int a[], long long int l, long long int r,
                  long long int x) {
  if (l <= r) {
    long long int m = l + (r - l) / 2;
    if (a[m] == x)
      return m;
    else if (a[m] > x)
      return bin(a, l, m - 1, x);
    else
      return bin(a, m + 1, r, x);
  } else
    return -1;
}
long long int power(long long int b, long long int e, long long int m) {
  if (e == 0) return 1;
  if (e % 2)
    return b * power(b * b % m, (e - 1) / 2, m) % m;
  else
    return power(b * b % m, e / 2, m);
}
long long int power(long long int b, long long int e) {
  if (e == 0) return 1;
  if (e % 2)
    return b * power(b * b, (e - 1) / 2);
  else
    return power(b * b, e / 2);
}
long long int ncr(long long int n, long long int r, long long int x) {
  if (r == 0) return 1;
  long long int fac[n + 1];
  fac[0] = 1;
  for (long long int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % x;
  return (fac[n] * power(fac[r], x - 2, x) % x * power(fac[n - r], x - 2, x) %
          x) %
         x;
}
long long int ncr(long long int n, long long int p) {
  long long int r = min(p, n - p), rf = 1, ln = 1;
  for (long long int i = 1; i <= r; i++) rf = rf * i;
  for (long long int i = 0; i < r; i++) ln = ln * (n - i);
  return ln / rf;
}
bool sbs(pair<long long int, long long int> &a,
         pair<long long int, long long int> &b) {
  return (a.second < b.second);
}
bool sbds(pair<long long int, long long int> &a,
          pair<long long int, long long int> &b) {
  return (a.second > b.second);
}
long long int SUM(long long int a[], long long int n) {
  long long int sum = 0;
  for (long long int i = 0; i < n; i++) sum += a[i];
  return sum;
}
long long int chkprm(long long int n) {
  for (long long int i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return 0;
  return 1;
}
long long int dp[2005][2005];
long long int solve(long long int a[], long long int l1, long long int r1,
                    long long int h, long long int l, long long int r,
                    long long int t) {
  if (l1 == r1) {
    if (((t + a[l1]) % h) >= l && ((t + a[l1]) % h) <= r) return 1;
    if (((t + a[l1] - 1) % h) >= l && ((t + a[l1] - 1) % h) <= r) return 1;
    return 0;
  }
  if (dp[l1][t] != -1) return dp[l1][t];
  long long int x1 = 0, x2 = 0;
  if (((t + a[l1]) % h) >= l && ((t + a[l1]) % h) <= r) x1++;
  if (((t + a[l1] - 1) % h) >= l && ((t + a[l1] - 1) % h) <= r) x2++;
  dp[l1][t] = max(x1 + solve(a, l1 + 1, r1, h, l, r, (t + a[l1]) % h),
                  x2 + solve(a, l1 + 1, r1, h, l, r, (t + a[l1] - 1) % h));
  return dp[l1][t];
}
void myth() {
  long long int n, h, l, r;
  cin >> n >> h >> l >> r;
  long long int a[n];
  for (long long int xxx = 0; xxx < n; xxx++) cin >> a[xxx];
  memset(dp, -1, sizeof(dp));
  cout << solve(a, 0, n - 1, h, l, r, 0);
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int test_case = 1;
  while (test_case--) {
    myth();
    cout << "\n";
  }
  return 0;
}
