#include<iostream>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<queue>
#include<set> 
#include<stack>
#include<bitset>
#include<unordered_map>
#include<iomanip>
#include<cassert>
#define fi first
#define se second
#define endl '\n'
#define pb push_back
#define ep emplace_back 
#define debug(x) cout<<x<<'\n'
#define RES cout<<res<<'\n'
#define ANS cout<<ans<<'\n'
#define YES	cout<<"YES"<<'\n'
#define NO cout<<"NO"<<'\n'
#define Yes	cout<<"Yes"<<'\n'
#define No cout<<"No"<<'\n'
#define me(a,x) memset(a,x,sizeof(a))
#define L(i,j,k) for(int i=(j);i<=(k);++i)
#define R(i,j,k) for(int i=(j);i>=(k);--i)
#define r23 cout<<233<<endl;return;
#define int long long 
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<PII,int> PIII;
typedef unsigned long long ull;
const int N=3e5+5,P=131,mod=998244353;
int n,k;
int a[N],pre[N],suf[N]; 

void solve(){
	cin>>n>>k;
	L(i,1,n)cin>>a[i];
	int g=0;
	L(i,1,n)pre[i]=g=__gcd(g,a[i]);
	g=0;
	R(i,n,1)suf[i]=g=__gcd(g,a[i]);
	int res=pre[n];
	L(i,0,n-1){
		if(pre[i]!=pre[i+1]){
			int cur=pre[i];
			L(j,i+1,n){
				cur=__gcd(cur,a[j]+k);
				res=max(res,__gcd(cur,suf[j+1]));
			}	
		}
	}
	RES;
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T=1;
	cin>>T;
	while(T--){
		solve();
	}
}