#include <iostream>
#include <fstream>

using namespace std;

ifstream fin ("rmq.in");
ofstream fout ("rmq.out");

const int maxN = 1e5 + 5;

int rmq[32][maxN];
int log[maxN];

int main()
{
    int n, m; fin >> n >> m;

    for(int i = 1; i <= n; ++i)
        fin >> rmq[0][i];

    log[2] = 1;
    for(int i = 3; i <= n; ++i)
        log[i] = log[i/2] + 1;

    for(int i = 1; i <= log[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) {
        int l, r; fin >> l >> r;

        int lg = log[r-l+1];

        fout << min(rmq[lg][l], rmq[lg][r - (1 << lg) + 1]) << '\n';
    }

    return 0;
}