#include <bits/stdc++.h>
#define N  5005
#define IO ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define mod 998244353
#define ll long long
using namespace std;

ll dp[N][N];
ll a[N];
ll cnt[N];
int T,n;

int main()
{
    IO;
    cin>>T;
    while(T--){
        int r,k;
        cin>>n>>k>>r;
        for(int i=1; i<=n; i++){
            cin>>a[i];
        }
        int nowp=0;
        for(int i=1; i<=n; i++){
            while(a[nowp+1]+r<=a[i])   nowp++;
            cnt[i] = nowp;
        }
        dp[0][0] = 1;
        for(int i=1; i<=n; i++){
            for(int j=i-cnt[i]; j<=k; j++){
                dp[i][j] = (dp[i-1][j-1] + 1LL * dp[i-1][j] * (j-(i-cnt[i]-1)))% mod;
            }
        }
        cout<<dp[n][k]<<endl;
        for(int i=1; i<=n; i++){
            for(int j=1; j<=k; j++){
                dp[i][j] = 0;
            }
        }
    }
    return 0;
}