#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;

typedef long long ll;

const int N = 1e6 + 5;

int n, q;
int a[N];
struct seq {
    int r, id;
};
vector<seq> s[N], t[N];
int maxn, ans[N], vis[N];
vector<int> d[N], pos;

int c[N];
int lowbit(int n) {
    return n & (-n);
}
void modify(int pos, int x) {
    while (pos <= n) {
        c[pos] = max(c[pos], x);
        pos += lowbit(pos);
    }
}
int query(int pos) {
    int ans = 0;
    while (pos) {
        ans = max(ans, c[pos]);
        pos -= lowbit(pos);
    }
    return ans;
}

void solve() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        maxn = max(maxn, a[i]);
    }
    for (int i = 1; i <= q; i++) {
        int l, r;
        cin >> l >> r;
        s[l].push_back({r, i});
        ans[i] = (r - l > 1);
    }

    for (int i = 2; i <= maxn; i++) {
        for (int j = i; j <= maxn; j += i)
            d[j].push_back(i);
    }
    for (int i = 2; i <= n; i++) {
        for (auto j : d[a[i]])
            vis[j] = 1;
    }
    for (int i = 2; i <= maxn; i++) {
        if (!vis[i])
            continue;
        pos.clear();
        for (int j = 1; j <= n; j++)
            if (a[j] % i == 0)
                pos.push_back(j);
        for (int j = 1; j < pos.size() - 1; j++) {
            int a = j - 1, b = j, c = 0;
            int val = 2 * pos[b] - pos[a];
            c = lower_bound(pos.begin() + b, pos.end(), val) - pos.begin();
            if (c == pos.size())
                continue;
            t[pos[a]].push_back({pos[c], i});
        }
    }
    for (int i = n; i >= 1; i--) {
        for (auto [r, val] : t[i])
            modify(r, val);
        for (auto [r, id] : s[i])
            ans[id] = max(ans[id], query(r));
    }
    for (int i = 1; i <= n; i++)
        cout << ans[i] << "\n";
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}