#include<bits/stdc++.h>
using namespace std;
constexpr int M=3e5+5,mod=998244353;
int n,m,blk,f[M],g[M];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
int rdc(int x){return x>=mod?x-mod:x;}
void init(int n){
    f[0]=g[0]=1;
    blk=ceil(sqrt(n));
    for (int i=1;i<=blk;i++){
        int p=i*i;
        for (int rep=0;rep<2;rep++)
            for (int j=i;j<=n-p;j++)
                f[j]=rdc(f[j]+f[j-i]);
        for (int j=p;j<=n;j++)
            g[j]=rdc(g[j]+f[j-p]);
    }
}
void solve(){
    n=read();m=read();
    for (int i=0;i<=m;i++) f[i]=g[i];
    for (int i=1;i<=n;i++){
        int x=read();
        for (int j=m;j>=x;j--)
            f[j]=rdc(f[j]+mod-f[j-x]);
    }
    printf("%d\n",f[m]);
}
int main(){init(3e5);int T=read();while (T--) solve();return 0;}