#include <bits/stdc++.h>
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
using i64 = long long;
#define rep(i, a, b) for (int i = a, I = b; i <= I; ++i)
#define per(i, a, b) for (int i = a, I = b; i >= I; --i)
template<typename T> void up(T &x, T y) { if (x < y) x = y; }
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

const int N = 100005, K = 17;
int n, q, lg[N];
i64 a[N], st[N][K];
vector<int> rp[N];

i64 query(int l, int r) {
    if (l > r) return 0;
    int k = lg[r - l + 1];
    return __gcd(st[l][k], st[r - (1 << k) + 1][k]);
}

i64 solve(int l, int r, int k, i64 p) {
    if (k >= r - l + 1) return p;
    if (k == 0) return __gcd(p, query(l, r));
    i64 res = -1;
    for (auto i : rp[l]) {
        if (i > r) break;
        up(res, solve(i + 1, r, k - 1, __gcd(p, query(l, i - 1))));
    }
    assert(res > 0);
    return res;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    cin >> n >> q;
    rep(i, 1, n) cin >> a[i];

    rep(i, 2, n) lg[i] = lg[i >> 1] + 1;
    per(i, n, 1) {
        st[i][0] = a[i];
        for (int k = 1; i + (1 << k) - 1 <= n; ++k) st[i][k] = __gcd(st[i][k - 1], st[i + (1 << (k - 1))][k - 1]);
    }

    per(i, n, 1) {
        rp[i].push_back(i);
        i64 last = a[i];
        for (auto j : rp[i + 1]) {
            i64 cur = query(i, j);
            if (cur != last) rp[i].push_back(j);
            last = cur;
        }
    }

    while (q--) {
        int l, r, k;
        cin >> l >> r >> k;
        cout << solve(l, r, k, 0) << "\n";
    }

    return 0;
}