#include <fstream>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

const int N = 100005;
int n, i, j, m, x, y, rmq[18][N], diff, log2[N];

int main() {
    f >> n >> m;
    for (i = 2; i <= n+1; i++) {
        f >> rmq[0][i-1];
        log2[i] = log2[i/2]+1;
    }
    for (i = 1; (1<<i) <= n; i++)
        for (j = 1; j+(1<<i)-1 <= n; j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1<<(i-1))]);

    while (m--) {
        f >> x >> y;
        diff = y-x+1;
        i = log2[diff];
        g << min(rmq[i][x], rmq[i][y-(1<<i)+1]) << '\n';
    }
}