#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
const int N = 1e2 + 5;
const int P = 998244353; 
int n, m, v, q, T, ans, a[N], f[N][N * N]; 

int inc (int a, int b) { return (a += b) >= P ? a - P : a; }
int dec (int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul (int a, int b) { return 1ll * a * b % P; }
int fpow (int a, int b) { int ans = 1; for ( ; b; a = mul(a, a), b >>= 1) if(b & 1) ans = mul(ans, a); return ans; }

int main () {
  ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0); 
  cin >> T;
  while (T--) {
    cin >> n >> m >> v, ans = 0;
    rep(i, 1, n) cin >> a[i]; 
    sort(a + 1, a + n + 1, [](int a, int b) { return a > b; }); 
    rep(y, 1, n) {
      rep(i, 1, y - 1) rep(j, 0, m * (y - 1)) f[i][j] = 0; 
      f[0][0] = 1; 
      rep(i, 1, y - 1) rep(j, 0, i * m) {
        if(j >= m) f[i][j] = inc(f[i][j], f[i - 1][j - m]); 
        if(a[i] - a[y] <= m) {
          q = (a[y] + m - a[i]); 
          if(q <= j) f[i][j] = inc(f[i][j], f[i - 1][j - q]); 
        }
      }
      rep(i, 0, (y - 1) * m) if(i + (n - y + 1) * m >= m * v) 
        ans = inc(ans, f[y - 1][i]); 
    }
    rep(x, 1, n) {
      rep(i, x, n) rep(j, 0, m * (n - x)) f[i][j] = 0; 
      f[x][0] = 1; 
      rep(i, x + 1, n) rep(j, 0, m * (i - x)) {
        f[i][j] = f[i - 1][j]; 
        if(a[x] - a[i] <= m) {
          q = a[x] - a[i]; 
          if(q <= j) f[i][j] = inc(f[i][j], f[i - 1][j - q]); 
        }
      }
      rep(i, 0, m * (n - x)) if(i > m * v) ans = dec(ans, f[n][i]); 
    }
    cout << ans << '\n'; 
  }
  return 0; 
}