#include<bits/stdc++.h>
#define LL long long
#define maxn 100010
#define maxm 10010
using namespace std;
const LL mod=(LL)998244353;
LL c[maxm];
void insert(int x,int y){for(;x<=maxm-10;x+=(x&-x))c[x]=(c[x]+y)%mod;return;}
LL get1(int x){LL ans=(LL)0;for(;x;x-=(x&-x))ans=(ans+c[x])%mod;return ans;}
LL getsum(int l,int r){return (get1(r)-get1(l-1)+mod)%mod;}
int n,l,r,t,a[maxn];
LL f[maxn];
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",&a[i]);
    f[1]=(LL)1;
    for(int i=l+1;i<=n;i++){
    	insert(a[i-l],f[i-l]);
    	if(i>=r+2)insert(a[i-r-1],(mod-f[i-r-1])%mod);
    	f[i]=getsum(max(1,a[i]-t),min(maxm-10,a[i]+t));
    }
    printf("%d\n",f[n]);
    return 0;
}