#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=N*20+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,A[N],k,B[N],vis[N];
ll m,d[N];
void Solve(){
	scanf("%d%lld",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&A[i]);
	sort(A+1,A+n+1);
	k=unique(A+1,A+n+1)-A-1;
	if(m<1ll*n*A[1]){
		puts("NO");return;
	}
	m-=1ll*n*A[1];for(int i=2;i<=k;i++) A[i]-=A[1];
	if(k==1){
		puts(!m?"YES":"NO");
		return;
	}
	fill(d,d+A[k],-INF);
	fill(vis,vis+A[k],0);
	d[0]=1ll*n*A[k];
	for(int i=1;i<=A[k];i++){
		int v=-1;
		for(int j=0;j<A[k];j++) if(!vis[j]&&(v==-1||d[v]<d[j])) v=j;
		vis[v]=1;
		gdb(v,d[v]);
		for(int j=2;j<k;j++){
			int u=(v+A[j])%A[k];
			d[u]=max(d[u],d[v]+A[j]-A[k]);
		}
	}
	if(d[m%A[k]]<m){puts("NO");return;}
	fill(d,d+A[k],INF);
	fill(vis,vis+A[k],0);
	d[0]=0;
	for(int i=1;i<=A[k];i++){
		int v=-1;
		for(int j=0;j<A[k];j++) if(!vis[j]&&(v==-1||d[v]>d[j])) v=j;
		vis[v]=1;
		for(int j=2;j<k;j++){
			int u=(v+A[j])%A[k];
			d[u]=min(d[u],d[v]+A[j]);
		}
	}
	if(d[m%A[k]]>m){puts("NO");return;}
	puts("YES");
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}