#include <bits/stdc++.h>
#define dbg(x) cout << #x << "=" << x << endl
#define eps 1e-8
#define pi acos(-1.0)
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
template<class T>inline void read(T &res)
{
char c;T flag=1;
while((c=getchar())<‘0‘||c>‘9‘)if(c==‘-‘)flag=-1;res=c-‘0‘;
while((c=getchar())>=‘0‘&&c<=‘9‘)res=res*10+c-‘0‘;res*=flag;
}
namespace _buff {
const size_t BUFF = 1 << 19;
char ibuf[BUFF], *ib = ibuf, *ie = ibuf;
char getc() {
if (ib == ie) {
ib = ibuf;
ie = ibuf + fread(ibuf, 1, BUFF, stdin);
}
return ib == ie ? -1 : *ib++;
}
}
int qread() {
using namespace _buff;
int ret = 0;
bool pos = true;
char c = getc();
for (; (c < ‘0‘ || c > ‘9‘) && c != ‘-‘; c = getc()) {
assert(~c);
}
if (c == ‘-‘) {
pos = false;
c = getc();
}
for (; c >= ‘0‘ && c <= ‘9‘; c = getc()) {
ret = (ret << 3) + (ret << 1) + (c ^ 48);
}
return pos ? ret : -ret;
}
const int maxn = 4007;
int a[maxn];
int n,h,l,r;
int f[maxn][maxn];
int dfs(int x, int now) {
//dbg(now);
if(x > n) {
return 0;
}
if(f[x][now] != -1) {
return f[x][now];
}
int temp = (now + a[x]) % h;
int res = 0;
int q = 0;
if(temp <= r && temp >= l) {
q++;
}
int res1 = q + dfs(x + 1, temp);
q = 0;
temp = (now + a[x] - 1) % h;
if(temp <= r && temp >= l) {
q++;
}
int res2 = q + dfs(x + 1, temp);
res = max(res1, res2);
f[x][now] = res;
return res;
}
int main()
{
scanf("%d %d %d %d",&n, &h, &l, &r);
for ( int i = 1; i <= n; ++i ) {
read(a[i]);
}
memset(f, -1, sizeof(f));
printf("%d\n",dfs(1,0));
return 0;
}
