#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
// #define int long long
#define pb push_back
#define endl '\n'
using ll = long long;
const ll mod = 1000000007;
const ll INF = 1ll << 60;
const int inf = 1 << 30;
const int N = 150010;
const int B = 388;

int n, q, a[N];
void solve() {
    cin >> n >> q;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    const int M = *max_element(a + 1, a + n + 1);
    vector<vector<int>> d(M + 1);
    for (int i = 1; i <= M; ++i) {
        for (int j = i; j <= M; j += i) {
            d[j].pb(i);
        }
    }
    vector<vector<int>> pos(M + 1);
    for (int i = 1; i <= n; ++i) {
        for (auto x : d[a[i]]) { // x | a[i]
            pos[x].pb(i);
        }
    }
    vector<vector<array<int, 2>>> e(n + 1); // e[l]: (r, gcd)
    for (int x = 1; x <= M; ++x) {
        if (pos[x].size() < 3) continue;
        for (int j = 1; j < pos[x].size(); ++j) {
            // k >= 2 * j - i
            auto it = lower_bound(all(pos[x]), 2 * pos[x][j] - pos[x][j - 1]);
            if (it != pos[x].end()) {
                e[pos[x][j - 1]].pb({*it, x});
            }
        }
    }
    vector<array<int, 3>> ask;
    for (int i = 1; i <= q; ++i) {
        int l, r; cin >> l >> r;
        ask.pb({l, r, i});
    }
    sort(all(ask), greater<array<int, 3>>());
    vector<int> ans(q + 1);
    vector<int> mx(n + 1), id(n + 1), L(n + 1), R(n + 1);
    for (int i = 1; i <= n; ++i) {
        id[i] = (i - 1) / B + 1;
        if (id[i] != id[i - 1]) {
            L[id[i]] = i;
            R[id[i]] = min(n, i + B - 1);
        }
    }
    vector<int> blk(id[n] + 1);
    auto modify = [&](int x, int v) { // O(1)
        // assert(x <= n);
        mx[x] = max(mx[x], v);
        blk[id[x]] = max(blk[id[x]], v);
    };
    auto bf_query = [&](int l, int r) {
        int ans = 0;
        for (int i = l; i <= r; ++i) ans = max(ans, mx[i]);
        return ans;
    };
    auto query = [&](int l, int r) { // max(1...x) O(sqrt(n))
        int ans = 0;
        if (id[l] == id[r]) {
            return bf_query(l, r);
        }
        ans = max(ans, bf_query(l, R[id[l]]));
        ans = max(ans, bf_query(L[id[r]], r));
        for (int i = id[l] + 1; i <= id[r] - 1; ++i) {
            ans = max(ans, blk[i]);
        }
        return ans;
    };
    for (int j = n; auto [ql, qr, qid] : ask) {
        while (j >= ql) {
            for (auto [r, d] : e[j]) {
                modify(r, d);
            }
            j -= 1;
        }
        ans[qid] = query(ql, qr);
    }
    for (int i = 1; i <= q; ++i) {
        cout << ans[i] << endl;
    }
}
signed main(void) {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int Test = 1;
    // cin >> Test;
    while (Test--) solve();
    return 0;
}