#include<bits/stdc++.h>
#define pb emplace_back
#define MP make_pair
using namespace std;
typedef pair< int, int > PII;
const int N = 1e6 + 10;
vector< PII > vec[N];
int n, q, a[N], ans[N];
int odr[N], l[N], r[N];
vector< int > v[N], tmp;
struct BIT {
	int c[N];
	int lowbit(int x) {return x & -x;}
	void add(int x, int y) {for(; x; x -= lowbit(x)) c[x] = max(c[x], y);}
	int ask(int x) {int res = 0; for(; x < N; x += lowbit(x)) res = max(res, c[x]); return res;}
} T;
bool cmp(int x, int y) {return r[x] < r[y];}
int main() {
	scanf("%d%d", &n, &q);
	for(int i = 1; i <= n; i ++ ) {
		scanf("%d", &a[i]);
		v[a[i]].pb(i);
	}
	for(int i = 1; i <= q; i ++ ) {
		scanf("%d%d", &l[i], &r[i]);
		odr[i] = i;
	}
	for(int d = 1; d <= 1000000; d ++ ) {
		tmp.clear();
		for(int j = 1; j * d <= 1000000; j ++ ) {
			for(auto k : v[d * j]) tmp.pb(k);
		}
		if(tmp.size() >= 3) {
			sort(tmp.begin(), tmp.end());
			for(int k = 0; k <= tmp.size() - 3; k ++ ) {
				int u = tmp[k], v = tmp[k + 1];
				int t = lower_bound(tmp.begin() + k + 2, tmp.end(), 2 * v - u) - (tmp.begin());
				if(t < tmp.size()) {
					vec[tmp[t]].pb(MP(u, __gcd(__gcd(a[u], a[v]), a[tmp[t]])));
				}
			}
		}
	}
	sort(odr + 1, odr + q + 1, cmp);
	int now = 1;
	for(int i = 1; i <= q; i ++ ) {
		int o = odr[i];
		while(now <= n && now <= r[o]) {
			for(auto k : vec[now]) T.add(k.first, k.second);
			now ++; 
		}
		ans[o] = T.ask(l[o]);
	}
	for(int i = 1; i <= q; i ++ ) printf("%d\n", ans[i]);
	return 0;
}
/*
8 8
8 24 4 6 6 7 3 3
1 5
2 6
3 7
5 8
4 8
1 3
2 5
3 8
*/