#include<bits/stdc++.h>

using namespace std;
const int N = 1e6 + 7;
const int M = 2e5 + 7;
int n, q;
int ans[N];
vector<int> p[N];
vector<pair<int, int>> add[M], ask[N];
int sum[M];

int low_bit(int x) {
    return x & (-x);
}

void update(int pos, int v) {
    for (int i = pos; i <= n; i += low_bit(i))sum[i] = max(sum[i], v);
}

int query(int pos) {
    int ans = 0;
    for (int i = pos; i > 0; i -= low_bit(i))ans = max(ans, sum[i]);
    return ans;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        for (int j = 1; j * j <= x; j++) {
            if (x % j == 0) {
                p[j].push_back(i);
                if (j * j != x)p[x / j].push_back(i);
            }
        }
    }
    for (int i = 1; i <= q; i++) {
        int l, r;
        cin >> l >> r;
        ask[l].push_back({r, i});
    }
    for (int i = 2; i <= 1e6; i++) {
        if (p[i].size() <= 2)continue;
        int siz = p[i].size();
        int l = siz - 2;
        for (int j = siz - 1; j >= 2; j--) {
            while (l > 0 && (p[i][l] - p[i][l - 1]) > (p[i][j] - p[i][l]))l--;
            if (l) {
                add[p[i][l - 1]].push_back({p[i][j], i});
            }
        }
    }
    for (int i = n; i >= 1; i--) {
        for (auto [pos, v]: add[i])update(pos, v);
        for (auto [pos, id]: ask[i])ans[id] = query(pos);
    }
    for (int i = 1; i <= q; i++)cout << max(1, ans[i]) << "\n";
    return 0;
}