#include<bits/stdc++.h>
#define ll long long 
using namespace std;

int main(){
  int t;
  cin >> t;
  while (t--){
    ll n, a, x, cur = 0, ans = 1, mx = 0;
    cin >> n >> x;
    //vector<ll> a(n);
    map<ll, ll> mp;
    for (int i = 0; i < n; i++){
      cin >> a;
      cur += a;
      mp[a] += a;
      mx = max(mx, a);
    }
    for (int i = 2; i <= min(mx + 1, x); i++){
      ll cnt = 0;
      for (int j = i; j <= mx; j += i){
        cnt += mp[j];
      }
      if (cnt < cur){
        cur = cnt, ans = i;
        if (cur == 0) break;
      }
    }
    cout << ans << endl;
  }
}