#include<bits/stdc++.h>
#define N 100009
#define D 100009
#define int long long 
using namespace std;
int n,m,k,a[N];
bitset<D*2>ok,ok2;
int aabs(int x,int y){
	return max(x-y,y-x);
}
void solve(){
	scanf("%lld%lld",&n,&m);
	unordered_set<int>s;int k=0;
	for(int i=1;i<=n;i++){
		int x;scanf("%lld",&x);
		s.insert(x);
	}
	for(auto i:s)a[++k]=i;
	sort(a+1,a+k+1);
	a[0]=-10000000000000;
	a[k+1]=10000000000000;
	int tmp=m/n;
	int pos=0;
	for(int i=1;i<=k;i++){
		if(a[i]<=tmp&&tmp<a[i+1])pos=i; 
	} 
	int c=0;
	for(int i=0;i<=n;i++){
		if(aabs(a[pos]*i+a[pos+1]*(n-i),m)<aabs(a[pos]*c+a[pos+1]*(n-c),m))c=i; 
	}
	m-=a[pos]*c+a[pos+1]*(n-c);
	if(aabs(m,0)>D){
		cout<<"No"<<endl;
		return;
	}
	ok.reset();
	ok[m+D]=1; 
	vector<int>p,q;
	for(int i=1;i<=k;i++){
		if(aabs(a[i],a[pos])<D/2-1&&i!=pos)p.push_back(a[i]-a[pos]);
		if(aabs(a[i],a[pos+1])<D/2-1&&i!=pos+1)q.push_back(a[i]-a[pos+1]); 
	} 
	if(ok[D]){
		cout<<"Yes"<<endl;
		return;
	}
	if(p.size())
	for(int i=1;i<=min(1ll*n/(int)p.size(),c);i++){
		ok2.reset();
		for(auto x:p){
			if(x<0)ok2|=(ok<<(-x));
			else ok2|=(ok>>x);
		}
		ok=ok2|ok;
		if(ok[D]){
			cout<<"Yes"<<endl;
			return;
		}
	}
	if(q.size())
	for(int i=1;i<=min(1ll*n/(int)q.size(),n-c);i++){
		ok2.reset();
		for(auto x:q){
			if(x<0)ok2|=(ok<<(-x));
			else ok2|=(ok>>x);
		} 
		ok=ok2|ok;
		if(ok[D]){
			cout<<"Yes"<<endl;
			return;
		}
	}
	cout<<"No"<<endl;
}
signed main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int t;scanf("%lld",&t);
	while(t--)solve();
	return 0;
}