#include <iostream>
using namespace std;
typedef long long ll;
const int MAXN=100000;
ll gcd(ll a,ll b){
    if(b==0)return a;
    else return gcd(b,a%b);
}
int n,q;
ll a[MAXN+5];
struct ST{
    ll f[MAXN+5][21];
    int lg[MAXN+5];
    void build(ll a[],int n){
        lg[0]=-1;
        for(int i=1;i<=n;i++){
            lg[i]=lg[i/2]+1;
            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]);
            }
        }
    }
    ll calc(int l,int r){
        int k=lg[r-l+1];
        return gcd(f[l][k],f[r-(1<<k)+1][k]);
    }
}st;
ll calc(int l,int r,int k,ll t){
    if(r-l+1<=k)return t;
    if(k==0){
        return gcd(st.calc(l,r),t);
    }
    ll cur=gcd(a[l],t),ans=calc(l+1,r,k-1,t);
    for(int i=l;i<=r;i++){
        int L=i,R=r;
        while(L<R){
            int mid=(L+R+1)/2;
            if(st.calc(i,mid)==cur){
                L=mid;
            }else{
                R=mid-1;
            }
        }
        ans=max(ans,gcd(calc(L+2,r,k-1,cur),t));
        cur=gcd(cur,a[L+1]);
        i=L+1;
    }
    return ans;
}
int main(){
    ios::sync_with_stdio(false);
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    st.build(a,n);
    while(q--){
        int l,r,k;cin>>l>>r>>k;
        cout<<calc(l,r,k,0)<<endl;
    }
    return 0;
}/*4 4
3 2 6 4
1 3 1*/