#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define gcd __gcd
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
using namespace std;

const int N=3e5+5, mod = 1e9+7, inf = 1e18;

int n, k;
int a[N], suf[N];

void solve() {
    cin >> n >> k;
    for (int i=1; i<=n; i++) cin >> a[i];
    suf[n+1] = 0;
    for (int i=n; i>=1; i--) suf[i] = gcd(suf[i+1], a[i]);
    int ans = suf[1];
    int tmp = 0;
    for (int i=1; i<=n; i++) {
        if(gcd(tmp, a[i])!=tmp) {
            int res = 0;
            for (int j=i; j<=n; j++) {
                res = gcd(res, a[j]+k);
                ans = max(ans, gcd(gcd(gcd(tmp, a[i]), res), suf[j+1]));
            }
        }
        tmp = gcd(tmp, a[i]);
    } 
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t; cin >> t;
    while(t--) {
        solve();
    }
}