#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

#define len(a) int((a).size())
#define all(a) begin(a), end(a)
#define rep(i, n) for (int i = 0; i < (n); i++)


int n, q;
vector<ll> a(n);


signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> q;
    a.resize(n);
    rep(i, n) cin >> a[i];
    vector<vector<pair<int, ll>>> stck(n + 1);
    stck[n] = {};
    for (int i = n - 1; i >= 0; i -= 1) {
        ll last = a[i];
        stck[i].push_back(make_pair(i, a[i]));
        for (auto [pos, x] : stck[i + 1]) {
            ll val = gcd(last, x);
            if (val != last) {
                stck[i].push_back(make_pair(pos, val));
                last = val;
            }
        }
    }
    function<ll(int, int, int)> get;
    get = [&](int l, int r, int k) -> ll {
        if (k == r - l + 1) return 0;
        assert(0 <= k and k < r - l + 1);
        if (k == 0) {
            auto it = upper_bound(all(stck[l]), make_pair(r, ll(1e18 + 10)));
            assert(it != stck[l].begin());
            return prev(it)->second;
        }
        ll last_val = 0;
        ll result = 0;
        for (auto [pos, g] : stck[l]) {
            if (pos + k - 1 > r) break;
            result = max(result, gcd(last_val, get(pos + 1, r, k - 1)));
            last_val = g;
        }
        return result;
        };
    rep(itr, q) {
        int l, r, k;
        cin >> l >> r >> k; --l; --r;
        ll rs = get(l, r, k);
        cout << rs << "\n";
    }
    return 0;
}


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

*/