#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

const int N = 101;
const int S = 101*101;
const int mod = 998244353;
int dp[N][S];

void add(int n, int x)
{
//    cout<<"add "<<n<<" "<<x<<"\n";
    for (int i=n-1; i>=0; i--)
        for (int s=0; s+x<S; s++)
            dp[i+1][s+x] = (dp[i+1][s+x] + dp[i][s])%mod;
}
void rem(int n, int x)
{
//    cout<<"rem "<<n<<" "<<x<<"\n";
//    for (int i=n-1; i>=0; i--)
    for (int i=0; i<n; i++)
        for (int s=0; s+x<S; s++)
            dp[i+1][s+x] = (dp[i+1][s+x] + mod - dp[i][s])%mod;
}

void solve()
{
    int n, m, v;
    cin>>n>>m>>v;
    vector<int> a(n);
    for (int i=0; i<n; i++)
        cin>>a[i];
    sort(a.begin(), a.end());

    int p = v;
    set<int> cur;
    int ans = 0;
    for (int it=0; it<2; it++)
    {
        if (n-1 >= p)
            ans ++;
        ans++;

        cur.clear();
        for (int i=0; i<=n; i++)
            for (int j=0; j<S; j++)
                dp[i][j] = 0;
        dp[0][0] = 1;

        for (int i=0; i+1<n; i++)
        {
            cur.insert(i);
            add(cur.size(), a[i]);

            int crit = a[i+1];
            for (auto it=cur.begin(); it!=cur.end(); )
            {
                if (a[*it] + m < crit)
                {
                    rem(cur.size(), a[*it]);
                    cur.erase(it++);
                }
                else
                    it++;
            }

            int alr = n-(i+2);
            // j + alr >= p
            for (int j=max<int>(0, p-alr); j<=cur.size(); j++)
            {
//                cout<<"sum "<<j<<" "<<crit*j-v*m<<" "<<crit*j<<"\n";
                for (int s=max<int>(0, crit*j-v*m); s<=min<int>(S-1, crit*j); s++)
                {
                    ans = (ans+dp[j][s])%mod;
//                    cout<<"ans "<<ans<<"\n";
                }
            }
//            cout<<"ans "<<ans<<"\n";
        }

        for (int i=0; i<n; i++)
            a[i] = 100-a[i];
        sort(a.begin(), a.end());
        v = n-v;
        p = n-p+1;
    }
    cout<<ans-1<<"\n";
}

signed main()
{
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

    int t;
    cin>>t;
    while (t--)
        solve();
}