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

typedef long long ll;

int n, l, r;
ll t; 
ll h[100010];
ll f[100010];
ll mod = 998244353;
    
int main()
{
    freopen("cirnoisclever.in", "r", stdin);
    freopen("cirnoisclever.out", "w", stdout);
        
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
            
    cin >> n >> l >> r >> t;
    for(int i = 1; i <= n; ++i)
        cin >> h[i];
    f[1] = 1;
    for(int i = 1; i <= n; ++i)
        for(int j = i+l; j <= min(i+r,n); ++j)
            if(abs(h[i]-h[j]) <= t)
            {
                f[j] += f[i];
                f[j] %= mod;
            }
    
    cout << f[n];    
    
   	return 0;
}