#include <stdio.h>
#include <stdlib.h>

#define L	19	// L = ceil(log2(n + 1))
#define N	300000

int max(int i, int j) { return i < j ? j : i; }

int gcd(int i, int j) { return j ? gcd(j, i % j) : i; }

int *ff[L], l2[N + 1];

int query(int l, int r) {
	int h = l2[r - l];

	return gcd(ff[h][l], ff[h][r - (1 << h)]);
}

int main() {
	int n, k, t;
	int i, j;
	int cnt, cnt_;
	static int aa[N], pp[N], qq[N];
	static int pg[N], sg[N];

	scanf("%d", &t);
	while (t--) {
		int g;

		scanf("%d%d", &n, &k);
		for (i = 0; i < n; ++i)
			scanf("%d", aa + i);
		l2[0] = -1;
		for (i = 1; i <= n; ++i)
			l2[i] = l2[i / 2] + 1;
		ff[0] = (int *) malloc(n * sizeof *ff[0]);
		for (i = 0; i < n; ++i)
			ff[0][i] = aa[i] + k;
		for (i = 1; (1 << i) <= n; ++i) {
			ff[i] = (int *) malloc((n - (1 << i) + 1) * sizeof *ff[i]);
			for (j = 0; j + (1 << i) <= n; ++j)
				ff[i][j] = gcd(ff[i - 1][j], ff[i - 1][j + (1 << (i - 1))]);
		}
		cnt = cnt_ = 0;
		pg[0] = aa[0], sg[n - 1] = aa[n - 1];
		for (i = 1; i < n; ++i)
			pg[i] = gcd(pg[i - 1], aa[i]);
		for (i = n - 1; i--;)
			sg[i] = gcd(sg[i + 1], aa[i]);
		for (i = 0; i < n - 1; ++i)
			if (pg[i] != pg[i + 1])
				pp[cnt++] = i;
		for (i = n; --i;)
			if (sg[i] != sg[i - 1])
				qq[cnt_++] = i;
		g = sg[0];
		for (i = 0; i < cnt; ++i)
			for (j = 0; j < cnt_; ++j)
				if (pp[i] + 1 < qq[j])
					g = max(g, gcd(pg[pp[i]], gcd(sg[qq[j]], query(pp[i] + 1, qq[j]))));
		printf("%d\n", g);
		for (i = 0; (1 << i) <= n; ++i)
			free(ff[i]);
	}
	return 0;
}