// Problem: D. Integral Array
// Contest: Codeforces - Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics)
// URL: https://codeforces.com/contest/1649/problem/D
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 2022-03-08 19:43:39
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> Vll;
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;
const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi = acos(-1.0);
inline ll qmi (ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) ans = ans * a%mod;
a = a * a %mod;
b >>= 1;
}
return ans;
}
inline int read () {
int x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f?-x:x;
}
template<typename T> void print(T x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) print(x/10);
putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
return (a + b) %mod;
}
inline ll inv (ll a) {
return qmi(a, mod - 2);
}
const int N = 2e6 + 10;
int cnt[N], st[N], a[N];
int n, m;
void solve() {
cin >> n >> m;
for (int i = 0; i <= m * 2 + 10; i ++)
st[i] = 0, cnt[i] = 0;
for (int i = 1; i <= n ;i ++) {
a[i] =read();
cnt[a[i]] = 1;
st[a[i]] = 1;
}
bool f= 0;
for (int i = 1; i <= m * 2 + 10; i ++)
cnt[i] += cnt[i - 1];
for (int i = 1; i <= m; i ++) {
if (!st[i]) continue;
for (int j = 1; j * i <= m ; j ++) {
int l = j * i, r = j * i + i -1;
if (cnt[r] - cnt[l - 1]) {
if (!st[j]) f = 1;
}
}
}
if (f) puts("No");
else puts("Yes");
}
int main () {
// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
int t;
t =1;
cin >> t;
while (t --) solve();
return 0;
}
