#include <bits/stdc++.h>
#define x first
#define y second
#define X first
#define Y second
using namespace std;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
using pii=pair<int,int>;
#define all(a) begin(a),end(a)
#define sz(a) (int)a.size()
#define pb push_back
#define rep(i,a,b) for(int i = (a);i < (b);i++)
#define PB push_back

const int N=100010;
const char en='\n';
const ll LLINF=1ll<<60;

const ll mod = 998244353, root = 62;

ll modpow(ll x, ll eks) {
	ll ret = 1;
	for(;eks;eks >>= 1) {
		if(eks & 1) ret = ret * x % mod;
		x = x * x % mod;
	}
	return ret;
}

void ntt(vl &a) {
	int n = sz(a), L = 31 - __builtin_clz(n);
	static vl rt(2, 1);
	for (static int k = 2, s = 2; k < n; k *= 2, s++) {
		rt.resize(n);
		ll z[] = {1, modpow(root, mod >> s)};
		rep(i,k,2*k) rt[i] = rt[i / 2] * z[i & 1] % mod;
	}
	vi rev(n);
	rep(i,0,n) rev[i] = (rev[i / 2] | (i & 1) << L) / 2;
	rep(i,0,n) if (i < rev[i]) swap(a[i], a[rev[i]]);
	for (int k = 1;k < n;k *= 2) 
		for(int i = 0;i < n; i += 2 * k) rep(j,0,k) {
			ll z = rt[j + k] * a[i + j + k] % mod, &ai = a[i + j];
			a[i + j + k] = ai - z + (z > ai ? mod : 0);
			ai += (ai + z >= mod ? z - mod : z);
		}
}

vl conv(const vl &a, const vl &b) {
	if(a.empty() || b.empty()) return {};
	int s = sz(a) + sz(b) - 1, B = 32 - __builtin_clz(s), n = 1 << B;
	int inv = modpow(n, mod - 2);
	vl L(a), R(b), out(n);
	L.resize(n), R.resize(n);
	ntt(L), ntt(R);
	rep(i,0,n) out[-i & (n - 1)] = (ll)L[i] * R[i] % mod * inv % mod;
	ntt(out);
	return {out.begin(), out.begin() + s};
}

map<pair<pair<ll,ll>,int>,vl> mem;
ll cn[N],m;
int t,n;

vl f(ll l,ll r,int k)
{
	if (mem.find({{l,r},k})!=mem.end()) return mem[{{l,r},k}];
	if (k==1)
	{
		vl odg(r-l+1);
		for (ll x=l;x<=r;++x) if (x>=0 && x<=n) odg[x-l]=cn[x];
		return mem[{{l,r},k}]=odg;
	}
	ll l1=(l-n)/2,r1=(r+n+1)/2;
	vl a=f(l1,r1,k/2);
	vl b=f(l1,r1,(k+1)/2);
	vl c=conv(a,b);
	vl odg(r-l+1);
	for (int i=0;i<=r-l;++i) odg[i]=c[i+(l-2*l1)];
	return odg;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>t;
	while (t--)
	{
		mem.clear();
		cin>>n>>m;
		for (int i=0;i<=n;++i) cn[i]=0;
		for (int i=0;i<n;++i)
		{
			int x;
			cin>>x;
			cn[x]=1;
			//cn[x]=max(rand(),1);
		}
		vl u=f(m,m,n);
		if (u[0]) cout<<"YES\n";
		else cout<<"NO\n";
	}
}