#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <tuple>
#include <iomanip>
#include <map>
#include <algorithm>
#include <math.h>
#include <string>
#include <vector>
#include <unordered_map>
#define ll long long
#define inf 10000000000007
#define mod 1000000007

using namespace std;

const int BLOCK = 450;


ll fastpow(ll n, ll x) {

	if (x == 0) {
		return 1;
	}
	else {
		ll ret = fastpow(n, x / 2);
		ret = ((ret % mod) * (ret % mod)) % mod;
		if (x % 2 == 0) {
			return ret;
		}
		else {
			return ((ret) * (n)) % mod;
		}
	}
}


ll gcd(ll a, ll b) {
	if (a == 0) {
		return b;
	}
	if (b == 0) {
		return a;
	}
	else {
		return gcd(b, a % b);
	}
}
ll lcm(ll a, ll b) {
	ll val = (a % mod * b % mod) % mod;
	val = (val * fastpow(gcd(a, b), mod - 2)) % mod;
	return val;
}
int Logk(ll n, ll k) {
	if (k == 1) {
		return 1;
	}
	if (n == 0) {
		return 0;
	}
	int count = -1;
	while (n > 0) {
		count++;
		n /= k;
	}
	return count;
}
struct Dsu {
	vector<int> par;

	void init(int n) {
		par.resize(n + 5, 0);
		for (int i = 1; i <= n; i++) par[i] = i;
	}

	int find(int u) {
		if (par[u] == u) return u;
		return par[u] = find(par[u]);
	}

	bool join(int u, int v) {
		u = find(u); v = find(v);
		if (u == v) return false;
		par[v] = u;
		return true;
	}
} dsu;

ll dp[300005][35];
void solve() {
	ll n, k;
	cin >> n >> k;
	vector<ll> a(n + 1);
	vector<ll> b(n + 1);
	vector<ll> prefix(n + 1);
	set<ll> sufix;
	map<ll, set<int>> second;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		b[i] = abs(a[i] - a[i - 1]);
	}
	prefix[1] = a[1];
	for (int i = 2; i <= n; i++) {
		prefix[i] = gcd(prefix[i - 1], a[i]);
	}
	for (int i = 1; i <= n; i++) {
		dp[i][0] = b[i];
	}
	if (k == 0) {
		cout << prefix[n] << endl;
		
		
		return;
	}
	else {
		bool equal = true;
		for (int i = 2; i <= n; i++) {
			if (a[i] != a[1]) {
				equal = false;
				break;
			}
		}
		if (equal) {
			cout << a[1] + k << endl;
			return;
		}
	}
	for (int j = 1; j < 30; j++) {
		for (int i = 1; i <= n; i++) {
			if (i + (1 << j) - 1 <= n) {
				dp[i][j] = gcd(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
			}
		}
	}
	ll kkk = a[1] + k;
	for (int i = 2; i <= n; i++) {
		kkk = gcd(kkk, a[i] + k);
	}

	ll ans = kkk;

	ll cur = a[n];
	sufix.insert(cur);
	second[cur].insert(n);
	for (int i = n - 1; i >= 1; i--) {
		if (i >= 1) {
			ll r = i;
			ll p = gcd(cur, a[1] + k);
			ll l = 1;
			if (i > 1) {
				ll log = Logk(r - l, 2);
				ll h = gcd(dp[l + 1][log], dp[r - (1LL << log) + 1][log]);
				p = gcd(p, h);

			}
			ans = max(ans, p);
		}

		cur = gcd(cur, a[i]);
		second[cur].insert(i);
		sufix.insert(cur);
		
	}
	
	for (int i = 1; i <= n; i++) {
		ll x = prefix[i];
		
		if (x == 1) {
			break;
		}
		
		for (auto it = sufix.begin(); it != sufix.end(); it++) {
			ll y = *it;
			
			ll p = gcd(x, y);
			if (p == 1)continue;
			int posL = i + 1;
			p = gcd(p, a[posL] + k);
			auto find = second[y].lower_bound(i + 2);
			if (find == second[y].end())continue;

			int posR = *find-1;
			
			if (posR == posL) {
				ans = max(ans, p);
			}
			else {
				ll log = Logk(posR - posL, 2);
				ll mid = gcd(dp[posL + 1][log], dp[posR - (1 << log) + 1][log]);
				p = gcd(mid, p);
				
				ans = max(ans, gcd(mid, p));
				
				
			}
		}
		if (i + 1 <= n) {
			ll l = i + 1;
			ll p = gcd(x, a[l] + k);
			ll r = n;
			if (l < r) {
				ll log = Logk(r - l, 2);
				ll h = gcd(dp[l + 1][log], dp[r - (1LL << log) + 1][log]);
				p = gcd(p, h);

			}
			ans = max(ans, p);
		}
		else {
			ans = max(ans, x);
		}
		
		

	}
	cout << ans << endl;

}



int main() {




	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	
	int t;
	cin >> t;
	while (t--) {
		solve();
	}






























}