#include <iostream>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
const int N=1e6+9,INF=1e9;
const double eps=1e-5;
typedef pair <int,int> PII;
inline int read()
{
    int x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
inline ll readll()
{
    ll x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
int n,q,a[N],st[N][21],lg[N];
int gcd(int x,int y)
{
    if(y==0) return x;
    return gcd(y,x%y);
}
int query(int l,int r)
{
    if(l>r) return 0;
    int k=lg[r-l+1];
    return gcd(st[l][k],st[r-(1<<k)+1][k]);
}
int solve(int l,int r,int k,int g)
{
    if(k==0) return gcd(g,query(l,r));
    int ans=solve(l+1,r,k-1,g);
    int R=l,tmp=gcd(a[l],g);
    while(true)
    {
        for(int i=lg[n];i>=0;i--)
            if(R+(1<<i)-1<=n && st[R][i]%tmp==0) R+=(1<<i);
        if(R>r) break;
        ans=max(ans,solve(R+1,r,k-1,tmp));
        tmp=gcd(tmp,a[R]);
    }
    return ans;
}
int main()
{
    // #define FILEIO
    #ifdef FILEIO
        freopen("in.in","r",stdin);
        freopen("out.out","w",stdout);
    #endif
    n=read(),q=read();
    for(int i=1;i<=n;i++) a[i]=read(),st[i][0]=a[i];
    for(int i=2;i<=n;i++) lg[i]=lg[i>>1]+1;
    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--)
    {
        int l=read(),r=read(),k=read();
        cout<<solve(l,r,k,0)<<'\n';
    }
    cerr<<endl<<1e3*clock()/CLOCKS_PER_SEC<<"ms";
    return 0;
}