#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int nMax = 100005;
int rmq[18][nMax], lg2[nMax];
int main()
{
    int n, m, x, y;
    f >> n >> m;
    for(int i = 1; i <= n; i++){
        f >> x;
        rmq[0][i] = x;
        if(i >= 2) {
            lg2[i] = 1 + lg2[i / 2];
        }
    }
    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))]);
        }
    }
    for(int i = 1; i <= m; i++) {
        f >> x >> y;
        int lng = lg2[y - x + 1];
        int ans = min(rmq[lng][x], rmq[lng][y - (1 << lng) + 1]);
        g << ans << "\n";
    }
    return 0;
}