#include <bits/stdc++.h>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int nMax = 100005;
int rmq[20][nMax], lg2[nMax], a[nMax];
inline void Build(int n) {
    for(int i = 1; i <= n; i++) {
        rmq[0][i] = a[i];
    }
    for(int i = 2; i <= n; i++) {
        lg2[i] = lg2[i / 2] + 1;
    }
    for(int i = 1; (1 << i) <= n; i++) {
        for(int j = 1; j + (1 << i) - 1 <= n; j++) {
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
        }
    }
}
int main()
{
    int n, q, x, y;
    f >> n >> q;
    for(int i = 1; i <= n; i++) {
        f >> a[i];
    }
    Build(n);
    for(int i = 1; i <= q; i++) {
        f >> x >> y;
        int dist = lg2[y - x + 1];
        int ans = min(rmq[dist][x], rmq[dist][y - (1 << dist) + 1]);
        g << ans << "\n";
    }
    return 0;
}