#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll n,l,r,t,a[100010],s[100010],res;
void dg (int x) {
    if (x==1) {
        res++;
        res%=mod;
        return;
    } 
    for (int i=l;i<=r;i++) {
        if (x-i<1) break;
        if (abs(s[x]-s[x-i])<=t) dg(x-i);
    }
}
int main () {
    freopen("cirnoisclever.in","r",stdin);
    freopen("cirnoisclever.out","w",stdout);
    cin >> n >> l >> r >> t;
    cin >> a[1];
    for (int i=2;i<=n;i++) {
        cin >> a[i];
        s[i]+=s[i-1]+(a[i]-a[i-1]);
    }
    dg(n);
    cout << res <<endl;
    return 0;
}