#include <bits/stdc++.h>
using namespace std;
#define M 100005
using ll = long long;
using pli = pair<ll,int>;
vector<pli>pre[M],nex[M];
ll A[M];
int n,q;
void update(int flg){
    vector<pli>t;
    for(int i=1;i<=n;i++){
        t.push_back(pli(A[i],i));
        vector<pli>tmp;
        for(int j = (int)t.size()-1;j>=0;j--){
            int k = j;
            ll v = __gcd(A[i],t[j].first);
            while(k>=1&& v == __gcd(A[i],t[k-1].first)) k--;
            tmp.push_back(pli(v,t[k].second));
            j = k;
        }
        t.clear();

        for(int j = (int)tmp.size()-1;j>=0;j--)t.push_back(tmp[j]);
        if(!flg) for(auto v: tmp)pre[i].push_back(v);
        else for(auto v: tmp)nex[n-i+1].push_back(pli(v.first,n-v.second+1));
    }
}
ll st[M][18];
int Log[M];
void Init(){
    for(int i=1;i<=n;i++)st[i][0] = A[i];
    for(int k=1;k<18;k++)
        for(int i=1;i+(1<<k)-1<=n;i++)
            st[i][k] = __gcd(st[i][k-1],st[i+(1<<k-1)][k-1]);
    for(int i=2;i<=n;i++)Log[i]=Log[i>>1]+1;
}
ll Ask(int l,int r){
    if(l>r)return 0;
    int k = Log[r-l+1];
    return __gcd(st[l][k],st[r-(1<<k)+1][k]);
}
ll Ask_k(int l,int r, int k, ll val){
    assert(r-l>=k-1);
    if(k==0) return __gcd(Ask(l,r),val);
    ll ret = Ask_k(l+1,r,k-1,val);
    for(int i = 0; i<nex[l].size();i++){
        int j = i;
        ll vt = __gcd(val,nex[l][i].first);
        while(j+1 < nex[l].size() && __gcd(val,nex[l][j+1].first) == vt) j++;
        if(nex[l][j+1].second + k < r){
            ret = max(ret,Ask_k(nex[l][j+1].second + 2, r, k-1, __gcd(vt, val)));
        }else{
            ret = max(ret, vt);
            break;
        }
        i=j;
    }
    return ret;
}
int main(){
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++)scanf("%lld",&A[i]);
    Init();
    update(0);
    reverse(A+1,A+1+n);
    update(1);
    reverse(A+1,A+1+n);
    while(q--){
        int l,r,k;
        scanf("%d%d%d",&l,&r,&k);
        printf("%lld\n",Ask_k(l,r,k,0));
    }
    return 0;
}