#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define _for(i, a, b) for(int i = (a); i <= (b); i++)
using namespace std;

typedef long long ll;
const int N = 5000 + 10;
const int mod = 998244353;
int L[N], a[N], n, k, R;
ll dp[N][N];

int main()
{
	int T; scanf("%d", &T);
	while(T--)
	{
		scanf("%d%d%d", &n, &k, &R);
		_for(i, 1, n) scanf("%d", &a[i]);

		int l = n;
		for(int r = n; r >= 1; r--)
		{
			while(l - 1 >= 0 && a[r] - a[l] < R) l--;
			L[r] = l;
		}

		dp[0][0] = 1;
		_for(i, 1, n)
			_for(j, 1, k)
			{
				dp[i][j] = dp[i - 1][j - 1];
				int t = i - L[i] - 1;
				if(j - t > 0) dp[i][j] = (dp[i][j] + dp[i - 1][j] * (j - t) % mod) % mod;
			}
		printf("%lld\n", dp[n][k]);
	}
	
	return 0;
}