#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1e5 + 5;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll n, q, a[N], f[N][25];
ll query(int l, int r){
    int k = __lg(r - l + 1);
    return __gcd(f[l][k], f[r - (1 << k) + 1][k]);
}
ll ans;
void solve(int l, int r, int k, ll lst){
    if(r - l + 1 < k) return;
    if(!k){
        if(l <= r) lst = __gcd(lst, query(l, r));
        ans = max(ans, lst);
        return;
    }
    // debug("solve [%d,%d] k:%d lst:%d\n", l, r, k, lst);
    int pos = l;
    vector<int> v;
    while(pos <= r){
        v.pb(pos);
        int L = pos, R = r, res = 0, cur = query(l, pos);
        while(L <= R){
            int mid = L + R >> 1;
            if(query(l, mid) == cur) res = mid, L = mid + 1;
            else R = mid - 1;
        }
        // debug("pos:%d cur:%d res:%d\n", pos, cur, res);
        pos = res + 1;
    }
    for(auto &i : v) solve(i + 1, r, k - 1, i == l ? lst : __gcd(lst, query(l, i - 1)));
}
int main(){
    read(n, q);
    _rep(i, 1, n) read(a[i]), f[i][0] = a[i];
    _rep(i, 1, 20) _rep(j, 1, n - (1 << i) + 1) f[j][i] = __gcd(f[j][i - 1], f[j + (1 << i - 1)][i - 1]);    
    while(q--){
        ll l, r, k; read(l, r, k);
        ans = -inf;
        solve(l, r, k, 0);
        writeln(ans);
    }
    return 0;
}