#include<bits/stdc++.h>
#define ll long long 

using namespace std;

const int N = 1e5 + 10;
const int M = 21;

int n , q;
ll a[N] , f[N] , st[M][N] , Log[N];

vector<pair<ll , int> > nxt[N];

ll gcd(ll a , ll b) {
    if(b == 0) return a;
    return gcd(b , a % b);
}

ll qry(int l , int r) {
    int k = Log[r - l + 1];
    return gcd(st[k][l] , st[k][r - (1 << k) + 1]);  
}

ll res = 0;

void dfs(int l , int r , int k , ll g) {
    if(l > r) {
        res = max(res , g);
        return;
    }
    if(k == 0) {
        res = max(res , gcd(g , qry(l , r)));
        return;
    }
    dfs(l + 1 , r , k - 1 , g);
    for(int i = 0 ; i < nxt[l].size() ; ++ i) {
        ll d = nxt[l][i].first; 
        int p = nxt[l][i].second + 1;
        if(p <= r && r - p >= k - 1) {
            dfs(p + 1 , r , k - 1 , gcd(g , d));
        }
    }
    return;
}

int main(void) {

    // freopen("rand.in" , "r" , stdin);
    // freopen("mine.out" , "w" , stdout);

    scanf("%d%d" , &n , &q);

    for(int i = 1 ; i <= n ; ++ i) {
        scanf("%lld" , &a[i]);
        st[0][i] = a[i];
    }

    Log[1] = 0;

    for(int i = 2 ; i <= n ; ++ i) {
        Log[i] = Log[i >> 1] + 1;
    }

    for(int k = 1 ; (1 << k) <= n ; ++ k) {
        for(int i = 1 ; i + (1 << k) - 1 <= n ; ++ i) {
            st[k][i] = gcd(st[k - 1][i] , st[k - 1][i + (1 << k - 1)]);
        }
    }

    for(int l = n ; l >= 1 ; -- l) {
        vector<pair<ll , int> > T;
        ll lst = 0;
        for(auto o : nxt[l + 1]) {
            ll d = o.first; int r = o.second;
            d = gcd(d , a[l]);
            if(d != lst) T.push_back({d , r});
            lst = d;
        }
        if(a[l] != lst) T.push_back({a[l] , l});
        nxt[l] = T;
    }

    while(q -- ) {
        int l , r , k;
        scanf("%d%d%d" , &l , &r , &k);
        res = 0; dfs(l , r , k , 0);
        printf("%lld\n" , res);
    }

    return 0;
}

/*
4 4
3 2 6 4
1 3 1
2 4 1
1 4 2
1 4 3


5 1
16 12 19 18 20 
1 5 3
*/