rt

#include "bits/stdc++.h"
#define int long long
using namespace std;
int n, m, len;
int a[1005], f[1005][25];
int gcd(int a, int b) {
    // if (b == 0) return a;
    // gcd(b, a % b);
    return b ? gcd(b, a % b) : a;
}
void create() {
    for (int i = 1; i <= n; i++) 
        f[i][0] = a[i];
    for (int j = 1; j <= len; j++) 
        for (int i = 1; i <= n - (i << j) + 1; i++)
            f[i][j] = gcd(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
}
int find(int l, int r) {
    int k = log2(r - l + 1);
    // while ((1 << (k + 1)) <= r- l + 1) k++;
    return gcd(f[l][k], f[r - (1 << k) + 1][k]);
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    len = log2(n);
    for (int i = 1; i <= n; i++) cin >> a[i];
    create();
    for (int i = 1; i <= m; i++) {
        int l, r;
        cin >> l >> r;
        cout << find(l, r) << endl;
    }
    return 0;
}