#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set> 
#define ll long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=2e5+5;
const int mod=998244353;
inline int read()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+(c-'0');
		c=getchar();
	}
	return x*f;
}
int T;
int a[maxn],b[maxn];
int f[5050][5050];
signed main()
{
	T=read();
	while(T--)
	{
		int n=read(),k=read(),d=read();
		rep(i,1,n) a[i]=read();
		rep(i,1,n)
		{
			int res=0;
			int l=1,r=i-1;
			while(l<=r)
			{
				int mid=(l+r)/2;
				if(a[i]-a[mid]>=d) l=mid+1,res=mid;
				else r=mid-1;
			}
			b[i]=res;
		}
		rep(i,0,n) rep(j,0,n-k) f[i][j]=0;
		f[0][0]=1;
		rep(i,1,n) rep(j,0,n-k) 
		{
			f[i][j]=1ll*(f[i-1][j]+1ll*f[i-1][j-1]*(1ll*(b[i]-(j-1)+mod)%mod)%mod)%mod;
		}
		printf("%d\n",f[n][n-k]);
	}
}