#include<iostream>
#include<cstdio>
#define N 100000
#define inf 1e9
using namespace std;
long long read()
{
    char c=0;
    long long sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
long long gcd(long long x,long long y)
{
    if (!y) return x;
    return gcd(y,x%y);
}
int n,q,lg[N+1];
long long a[N+1],ST[N+1][21],ans;
long long query(int l,int r)
{
    if (l>r) return 0;
    int lw=lg[r-l+1];
    return gcd(ST[l][lw],ST[r-(1<<lw)+1][lw]);
}
bool check(int l,int r,int d)
{
    int lw=lg[r-l+1];
    return ST[l][lw]%d==0&&ST[r-(1<<lw)+1][lw]%d==0;
}
void solve(int l,int r,int k,long long d)
{
    if (!k)
    {
	ans=max(ans,gcd(d,query(l,r)));
	return;
    }
    int x=l,y;
    solve(l+1,r,k-1,d),d=gcd(d,a[l]);
    while (x+k<=r)
    {
	y=x;
	for (int i=lg[n];i>=0;--i)
	    if (y+(1<<i)<=r-k&&check(l,y+(1<<i),d))
		y+=(1<<i);
        solve(y+2,r,k-1,d),x=y+1,d=gcd(d,a[y+1]); 
    }
    return;
}
int main()
{
    int l,r,k;
    for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
    n=read(),q=read();
    for (int i=1;i<=n;++i) a[i]=read(),ST[i][0]=a[i];
    for (int i=1;i<=lg[n];++i)
	for (int j=1;j+(1<<i)-1<=n;++j)
	    ST[j][i]=gcd(ST[j][i-1],ST[j+(1<<(i-1))][i-1]);
    while (q--) ans=0,l=read(),r=read(),k=read(),solve(l,r,k,0),printf("%lld\n",ans);
    return 0;
}