#include<bits/stdc++.h>
#define int long long
const int mod = 998244353;
const int G = 3;
using namespace std;
const int maxn = 1e5+114;
int n,lim;
int T;
int k,w[maxn],m;
int C;//m%k
//[-2k,2k+1) -> [0,4k+1)
int qpow(int a,int b){
    if(b==0) return 1;
    if(b==1) return a;
    int res=qpow(a,b/2);
    res=res*res%mod;
    if(b%2==1) res=res*a%mod;
    return res;
}
mt19937 rd(time(0));
vector<int> solve(int a){
    vector<int> res;
    res.resize(4*k+1);
    if(a==0){
        res[2*k]=rd()%(mod/2)+1;
        return res; 
    }
    if(a==1){
        for(int i=1;i<=k;i++) res[w[i]+2*k]=rd()%(mod/2)+1;
        return res;
    }
    res=solve(a/2);
    for(int i=0;i<res.size();i++){
        if(res[i]!=0) res[i]=rd()%(mod/2)+1;
    }
    //[0,8k+1) [-4k,4k+1) [-2k,2k+1)
    //res = res*res [0,8k+1) -> [2k,6k+1)
    vector<int> f=res;
    vector<int> g;
    vector<int> r;
    n=1,lim=0;
    while(n<8*k+1) n<<=1,lim++;
    r.resize(n);
    f.resize(n);
    g.resize(n);
    if(a%2==1){
        for(int i=1;i<=k;i++) g[w[i]+2*k]=1;
    }else g[2*k]=1;
    for(int i=1;i<n;i++) r[i]=((r[i>>1]>>1)|((i&1)<<(lim-1)));
    for(int i=0;i<n;i++){
        if(i<r[i]) swap(f[i],f[r[i]]),swap(g[i],g[r[i]]);
    }
    for(int len=2,k=1;len<=n;len<<=1,k<<=1){
        int Wn=qpow(G,(mod-1)/len);
        for(int i=0;i<n;i+=len){
            for(int j=0,w=1;j<k;j++,w=w*Wn%mod){
                int x=f[i+j],y=f[i+j+k]*w%mod;
                f[i+j]=(x+y)%mod;
                f[i+j+k]=(x+mod-y)%mod;
                x=g[i+j],y=g[i+j+k]*w%mod;
                g[i+j]=(x+y)%mod;
                g[i+j+k]=(x+mod-y)%mod;
            }
        }
    }
    for(int i=0;i<n;i++) f[i]=f[i]*f[i]%mod*g[i]%mod;
    for(int i=0;i<n;i++){
        if(i<r[i]) swap(f[i],f[r[i]]);
    }
    for(int len=2,k=1;len<=n;len<<=1,k<<=1){
        int Wn=qpow(qpow(G,mod-2),(mod-1)/len);
        for(int i=0;i<n;i+=len){
            for(int j=0,w=1;j<k;j++,w=w*Wn%mod){
                int x=f[i+j],y=f[i+j+k]*w%mod;
                f[i+j]=(x+y)%mod;
                f[i+j+k]=(x+mod-y)%mod;
            }
        }
    }
    int inv=qpow(n,mod-2);
    for(int i=0;i<n;i++) f[i]=f[i]*inv%mod;
    //f[2k] to f[6k]
    return res;
}
void work(){
    cin>>k>>m;
    for(int i=1;i<=k;i++){
        cin>>w[i];
        w[i]-=(m/k);
    }   
    m-=(m/k)*k;
    vector<int> dp=solve(k);
    cout<<(dp[m+2*k]!=0?"Yes\n":"No\n");
    return ;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int t;
    cin>>t;
    while(t--) work();
    return 0;
}