//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#ifdef LOCAL
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
inline bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef LOCAL
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif // LOCAL

const int max_n = -1, inf = 1000111222;


struct node {
public:
    ll val;
    node (ll x = 0) : val(x) {}
};

inline node comb (node a, node b) {
    return node(gcd(a.val, b.val));
}

struct RMQ {
    /// init O(n*logn) time and memory
    /// query O(1)
public:
    int n, k;
    vector <vector <node> > up;
    vector <int> f;
    vector <ll> a;

    RMQ() {}

    RMQ (int n, vector <ll> a) : n(n), a(a) {
        k = 0;
        while ((1 << k) <= n) {
            ++k;
        }
        init();
    }

    inline void init () {
        up.assign(k, vector <node> (n));
        for (int st = 0; st < k; st++) {
            int len = 1 << st;
            for (int c = len; c < n + len; c += len * 2) {
                if (c < n) {
                    up[st][c] = node(a[c]);
                }
                if (c - 1 < n) {
                    up[st][c - 1] = node(a[c - 1]);
                }
                for (int i = c + 1; i < c + len; i++) {
                    if (i >= n) break;
                    up[st][i] = comb(up[st][i - 1], node(a[i]));
                }
                for (int i = c - 2; i >= c - len; i--) {
                    if (i >= n) continue;
                    if (i + 1 < n) {
                        up[st][i] = comb(node(a[i]), up[st][i + 1]);
                    }
                    else {
                        up[st][i] = node(a[i]);
                    }
                }
            }
        }
        f.resize(n + n);
        for (int i = 2; i < n + n; i++) {
            f[i] = f[i / 2] + 1;
        }
    }

    node query (int l, int r) {
        if (l == r) return node(a[r]);
        int t = f[l ^ r];
        return comb(up[t][l], up[t][r]);
    };

};


int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, q;
    cin >> n >> q;
    vector <ll> a(n);
    for (auto &i : a) {
        cin >> i;
    }
    RMQ t(n, a);
    auto fnd_nxt = [&] (ll g, int st, int r) {
        if (st > r) {
            return n;
        }
        if (g == 0) {
            return st;
        }
        int L = st, R = r;
        while (L < R) {
            int mid = (L + R) >> 1;
            if (t.query(st, mid).val >= g) {
                L = mid + 1;
            }
            else {
                R = mid;
            }
        }
        if (t.query(st, R).val >= g) {
            return n;
        }
        return R;
    };
    function <ll(int, int, int)> solve = [&] (int l, int r, int k) -> ll {
//        LOG(l, r, k);
        if (l > r) {
            return 0;
        }
        if (k == 0) {
            return t.query(l, r).val;
        }
        ll cur = 0;
        int pos = fnd_nxt(cur, l, r);
        ll ans = 0;
        while (pos <= r) {
            LOG(cur, pos, l, r, k, a[pos], t.query(l, pos).val);
            umax(ans, gcd(cur, solve(pos + 1, r, k - 1)));
            cur = gcd(cur, a[pos]);
            pos = fnd_nxt(cur, l, r);
        }
        umax(ans, cur);
        return ans;
    };
    for (int i = 0, l, r, k; i < q; i++) {
        cin >> l >> r >> k;
        --l, --r;
        cout << solve(l, r, k) << '\n';
    }
}