#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
int a[N];
void solve(){
int n;
cin >> n;
for(int i = 1 ; i <= n ; i++){
cin >> a[i];
}
bool flag = 1;
int t = a[1];
for(int i = 2 ; i <= n ; i++){
if(a[i] % t != 0){
flag = 0;
break;
}
}
if(flag) cout << "YES" << "\n";
else cout << "NO" << "\n";
}
int main(){
int tt;
cin >> tt;
while(tt -- ){
solve();
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
int a[N];
void solve(){
int n, l, r;
cin >> n >> l >> r;
bool flag = 1;
for(int i = 1; i <= n; i++){
a[i] = r / i * i;
if(a[i] < l ){
flag = 0;
break;
}
}
if(flag){
cout << "YES" << "\n";
for(int i = 1; i <= n; i++) cout << a[i] << " ";
cout << "\n";
}
else cout << "NO" << "\n";
}
int main(){
int tt;
cin >> tt;
while(tt--){
solve();
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
int a[N];
void solve(){
int n,m;
cin >> n >> m;
string s(n,'0');
for(int i = 0; i < n; i++) cin >> a[i];
int q=0;
for(int i = n-1; i >= 0; i--){
if(a[i] <= q) s[i] = '1';
else if(a[i] > q && q < m){
q++;
s[i] = '1';
}
}
cout << s << "\n";
}
int main(){
int tt;
cin >> tt;
while(tt--){
solve();
}
return 0;
}