#include <bits/stdc++.h>
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define rep(i, a, b) for (int i = (a), I = (b); i <= I; ++i)
#define per(i, a, b) for (int i = (a), I = (b); i >= I; --i)
using i64 = long long;
using pii = pair<int, int>;
template<typename T> void up(T &x, T y) { if (x < y) x = y; }
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

const int P = 998244353;
void add(int &x, int y) { (x += y) >= P && (x -= P); }
int Add(int x, int y) { return (x += y) >= P ? (x - P) : x; }
void sub(int &x, int y) { (x -= y) < 0 && (x += P); }
int Sub(int x, int y) { return (x -= y) < 0 ? (x + P) : x; }
void mul(int &x, int y) { x = 1ll * x * y % P; }
int Mul(int x, int y) { return 1ll * x * y % P; }
int power(int a, int b, int c = 1) {
    for (; b; b >>= 1, mul(a, a))
        if (b & 1) mul(c, a);
    return c;
}

const int N = 105;
int n, m, v, a[N], dp[N * N], C[N][N];

void add(int x) {
    per(i, N * N - 1, x) dp[i] += dp[i - x];
}

void solve() {
    cin >> n >> m >> v;
    rep(i, 1, n) cin >> a[i];
    sort(a + 1, a + n + 1);

    int ans = 1;
    rep(i, 0, n) {
        C[i][0] = 1;
        rep(j, 1, i) C[i][j] = Add(C[i - 1][j - 1], C[i - 1][j]);
    }
    rep(i, 1, n) {
        {
            int j = i + 1;
            memset(dp, 0, sizeof dp);
            dp[0] = 1;
            while (j <= n && a[j] <= a[i] + m) add(a[j++] - a[i]);
            rep(k, 0, m * (n - v)) add(ans, dp[k]);
            rep(k, max(0, v - (n - j + 1)), j - i - 1) sub(ans, C[j - i - 1][k]);
        }
        {
            int j = i - 1;
            memset(dp, 0, sizeof dp);
            dp[0] = 1;
            while (j && a[j] >= a[i] - m) add(a[i] - a[j--]);
            rep(k, 0, m * v) add(ans, dp[k]);
            rep(k, 0, v - (n - i)) sub(ans, C[i - j - 1][k]);
        }
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    int T; cin >> T;
    while (T--) solve();

    return 0;
}