#include <bits/stdc++.h>
#define int long long

using namespace std;

struct ST {
    vector <vector <int>> f;
    vector <int> lg;

    ST (int n, vector <int> a) {
        lg.resize (n + 1);
        f.assign (n + 1, vector <int> (lg[n] + 1));
        for (int i = 1; i <= n; i ++) {
            f[i][0] = a[i];
        }

        for (int j = 1; j <= lg[n]; j ++) {
            for (int i = 1; i + (1 << j) - 1 <= n; i ++) {
                f[i][j] = gcd (f[i][j - 1], f[i + (1 << j - 1)][j - 1]);
            }
        }
    } 

    int query (int l, int r) {
        int k = lg[r - l + 1];
        return gcd (f[l][k], f[r - (1 << k) + 1][k]);
    }
};

void solve () {
    int n, k;
    cin >> n >> k;

    vector <int> a (n + 1);
    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
    }

    vector <int> pre (n + 2), suf (n + 2);
    pre[1] = a[1];
    suf[n] = a[n];
    for (int i = 2; i <= n; i ++) {
        pre[i] = gcd (pre[i - 1], a[i]);
    }
    for (int i = n - 1; i >= 1; i --) {
        suf[i] = gcd (suf[i + 1], a[i]);
    }

    vector <int> b (n + 1);
    for (int i = 1; i <= n; i ++) {
        b[i] = a[i] + k;
    }

    ST st (n, b);

    int maxx = 0;
    for (int i = 1; i <= n; i ++) {
        for (int j = i; j <= n; j ++) {
            int l = j, r = n;
            auto check = [&] (int x) {
                return st.query (i, x) == st.query (i, j);
            };
            while (l < r) {
                int mid = (l + r + 1) / 2;
                if (check (mid)) {
                    l = mid;
                } else {
                    r = mid - 1;
                }
            }
            int gc = st.query (i, l);
            if (i > 1) {    
                gc = gcd (gc, pre[i - 1]);
            }
            if (l < n) {
                gc = gcd (gc, suf[l + 1]);
            }
            maxx = max (maxx, gc);
            j = l;
        }
    }

    cout << maxx << '\n';
}

signed main () {
    ios::sync_with_stdio (false);
    cin.tie (nullptr);

    int T = 1;
    cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}