#include<bits/stdc++.h>

using namespace std;

const int N = 2e5 + 100;
struct query {
    int l, r, id;
}qs[N];
struct opra {
    int i, k, d;
};
vector <opra> f;
int n, q, a[N];
const int M = 1e6 + 100;
vector <int> b[M];
int sta[N], val[N], ans[N];

bool cmp1(query x, query y) {
    return x.r < y.r;
}

bool cmp2(opra x, opra y) {
    return x.k < y.k;
}

struct SZSZ {
    int f[N];
    
    void add(int x, int d) {
        for (; x; x -= (x & (-x))) f[x] = max(f[x], d);
    }

    int query(int x) {
        int re = 0;
        for (; x <= n; x += (x & (-x))) re = max(re, f[x]);
        return re;
    }
}T;

int main() {
    scanf("%d %d", &n, &q);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        for (int j = 1; j * j <= a[i]; j++)
            if (a[i] % j == 0) {
                b[j].push_back(i);
                if (j * j != a[i]) b[a[i] / j].push_back(i);
            }
    }
    for (int i = 1; i <= q; i++) {
        scanf("%d %d", &qs[i].l, &qs[i].r);
        qs[i].id = i;
    }
    sort(qs + 1, qs + q + 1, cmp1);

    // return 0;

    for (int d = 1; d <= 1000000; d++) {
        sta[0] = 0;
        for (int x = 0; x < (int)b[d].size() - 1; x++) {
            int i = b[d][x], j = b[d][x + 1];
            int dis = 2 * j - i;
            while (sta[0] && dis <= val[sta[0]]) sta[0]--;
            sta[++sta[0]] = i;
            val[sta[0]] = dis;
        }
        int zz = 0;
        for (int x = 0; x < b[d].size(); x++) {
            int k = b[d][x];
            while (zz < sta[0] && val[zz + 1] <= k) zz++;
            if (zz && k >= val[zz]) {
                f.push_back((opra){sta[zz], k, d});
            }
        }
    }
    sort(f.begin(), f.end(), cmp2);

    // return 0;

    int zz = 0, zzq = 1;
    for (int i = 1; i <= n; i++) {
        while (zz < f.size() && f[zz].k == i) {
            T.add(f[zz].i, f[zz].d);
            zz++;
        }
        while (zzq <= q && qs[zzq].r == i) {
            ans[qs[zzq].id] = T.query(qs[zzq].l);
            zzq++;
        }
    }
    for (int i = 1; i <= q; i++) printf("%d\n", ans[i]);

    return 0;
}