#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=1e5+10,K=__lg(N)+2;
int n,m;
ll a[N];
struct zj{
	ll val;
	int id;
};
using vs=vector<zj>;
vs merge(const vs &A,const vs &B){
	if(A.empty())return B;
	vs C=A;
	for(zj x:B){
		if(x.val%C.back().val){
			ll v=__gcd(x.val,C.back().val);
			C.push_back({v,x.id});
		}
	}
	return C;
}
vs t[N<<2];
void build(int l=1,int r=n,int rt=1){
	if(l==r){
		t[rt]={{a[l],l}};return;
	}
	int mid=(l+r)>>1;
	build(l,mid,rt<<1);
	build(mid+1,r,rt<<1|1);
	t[rt]=merge(t[rt<<1],t[rt<<1|1]);
}
void query(int L,int R,vs &ans,int l=1,int r=n,int rt=1){
	if(L<=l&&r<=R){
		ans=merge(ans,t[rt]);return;
	}
	int mid=(l+r)>>1;
	if(L<=mid)query(L,R,ans,l,mid,rt<<1);
	if(mid<R)query(L,R,ans,mid+1,r,rt<<1|1);
}
ll f[K][N];
void init(){
	for(int i=1;i<=n;i++)f[0][i]=a[i];
	for(int i=1;(1<<i)<=n;i++){
		for(int j=1;j+(1<<i)-1<=n;j++){
			f[i][j]=__gcd(f[i-1][j],f[i-1][j+(1<<i-1)]);
		}
	}
}
ll calc(int l,int r){
	if(l>r)return 0;
	int k=__lg(r-l+1);
	return __gcd(f[k][l],f[k][r-(1<<k)+1]);
}
ll calc(int l,int r,int k){
	if(l>r)return 0;
	if(!k)return calc(l,r);
	vs ans;
	query(l,r,ans);
	ll res=0;
	for(zj x:ans){
		res=max(res,__gcd(calc(l,x.id-1),calc(x.id+1,r,k-1)));
	}
	return res;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
	build(),init();
	for(int l,r,k;m--;){
		scanf("%d%d%d",&l,&r,&k);
		printf("%lld\n",calc(l,r,k));
	}
	return 0;
}