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

inline ll read(){
	ll s=0,k=1;
	char c=getchar();
	while(c>'9'||c<'0'){
		if(c=='-') k=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		s=(s<<3)+(s<<1)+(c^48);
		c=getchar();
	}
	return s*k;
}

const int mod=998244353,N=1e5+10;
int n,lgn,r[N<<2];
ll m,g,gi,lim;

ll ksm(ll a,int b){
	ll t=1;
	for(;b>0;b>>=1,a=a*a%mod)
		if(b&1) t=t*a%mod;
	return t;
}

void NTT(vector<ll> &a,bool op){
	for(int i=0;i<lim;i++) 
		if(i<r[i]) swap(a[i],a[r[i]]);
	for(int len=2;len<=a.size();len<<=1)
		for(int i=0;i<lim;i+=len){
			ll wn=ksm(op?gi:g,(mod-1)/len),w=1;
			for(int j=i;j-i<(len>>1);j++){
				ll a1=a[j],a2=a[j+(len>>1)]*w%mod;
				a[j]=a1+a2;
				if(a[j]>=mod) a[j]-=mod;
				a[j+(len>>1)]=a1-a2+mod;
				if(a[j+(len>>1)]>=mod) a[j+(len>>1)]-=mod;
				(w*=wn)%=mod;
			}
		}
	if(op){
		ll inv=ksm(lim,mod-2);
		for(int i=0;i<lim;i++) (a[i]*=inv)%=mod;
	}
}

vector<ll> operator * (vector<ll> a,vector<ll> b){
	lim=1,lgn=0;
	while(lim<a.size()+b.size()) lim<<=1,lgn++;
	for(int i=0;i<lim;i++) r[i]=r[i>>1]>>1|i%2<<lgn-1;
	a.resize(lim);b.resize(lim);
	vector<ll> c(lim);
	NTT(a,0);NTT(b,0);
	for(int i=0;i<lim;i++) c[i]=a[i]*b[i]%mod;
	NTT(c,1);
	return c;
}

vector<ll> mul(vector<ll> a,vector<ll> b){
	vector<ll> t=a*b;
	vector<ll> c(n+n+1);
	for(int i=0;i<=n+n;i++) c[i]=(t[n+i]!=0);
	return c;
}

void solve(){
	n=read();m=read();
	ll d=m/n;
	int b=n;
	vector<ll> a(n+n+1);
	vector<ll> t(n+n+1);
	for(int i=1;i<=n;i++){
		ll x=read();
		a[n+x-d]=1;
	}
	t[n]=1;
	for(;b>0;b>>=1){
		if(b&1) t=mul(t,a);	
		a=mul(a,a);
	}
	if(t[n+m%n]) puts("Yes");
	else puts("No");
}

int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	g=3;gi=ksm(3,mod-2);
	int T=read();
	while(T--) solve();
	return 0;
}