#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pi pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define ls (rt<<1)
#define rs (rt<<1|1)
#define lowbit(i) (i&(-i))
#define mid ((l+r)>>1)
#define int long long
inline int read(){
	char ch=getchar();int x=0;bool f=0;
	for(;!isdigit(ch);ch=getchar())if(ch=='-')f=1;
	for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
	if(f==1)x=-x;return x;
}
const int maxn=1e5+5,M=(1<<30)-1;
int n,m,a[maxn],f[maxn][21],l,r,k,q,lg[maxn];
int gcd(int x,int y){
	if(!x||!y)return x+y;
	if(y>x)swap(x,y);
	return gcd(y,x%y);
}
int get(int l,int r){
	int p=lg[r-l+1];
	return gcd(f[l][p],f[r-(1<<p)+1][p]);
}
int solve(int l,int r,int k,int G){
	int res=0;
	if(k==0)return get(l,r);
	res=max(res,solve(l+1,r,k-1,G));
	if(!G)G=a[l];
	int u=l;
	while(true){
		for(int i=20;i>=0;i--)
			if(f[l][i]%G==0){
				u=u+(1<<i);
			}
		if(u>r)break;
		res=max(res,solve(u+1,r,k-1,G));
		G=gcd(G,a[u]);
	}res=max(res,G);
	return res;
}
signed main(){
	n=read();q=read();lg[1]=0;
	for(int i=2;i<=n;i++)lg[i]=lg[i/2]+1;
	for(int i=1;i<=n;i++)a[i]=read(),f[i][0]=a[i];
	for(int i=1;i<=20;i++)
		for(int j=1;j+(1<<i)-1<=n;j++)
			f[j][i]=gcd(f[j][i-1],f[j+(1<<(i-1))][i-1]);
	for(int i=1;i<=q;i++){
		l=read(),r=read(),k=read();
		printf("%lld\n",solve(l,r,k,0));
	}
	return 0;
}