#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll const Mod=998244353;
int n,l,r,t;
ll h[100010],f[100010];

int main(){
    freopen("cirnoisclever.in","r",stdin);
    freopen("cirnoisclever.out","w",stdout);
    
    scanf("%d %d %d %d",&n,&l,&r,&t);
    for (int i=1;i<=n;i++) scanf("%d",&h[i]);
    f[1]=1;
    if (!t && h[1]!=h[n]){
        printf("0\n");
        return 0;
    }
    ll c;
    for (int i=1;i<=n;i++){
        for (int j=i+l;j<=i+r;j++){
            if (n<j) break;
            c=h[i]-h[j];
            if (c<0) c*=-1;
            if (c<=t) f[j]+=f[i],f[j]%=Mod;
        }
    }
    printf("%lld",f[n]);
    
    return 0;
}