#include <iostream>
#include <fstream>

using namespace std;

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

#define Nmax 100005

int n, m, A[Nmax], M[Nmax][20];

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        fin >> A[i];
        M[i][0] = i;
    }

    for(int j = 1; (1 << j) <= n; ++j)
        for(int i = 1; i + (1 << j) - 1 <= n; ++i)
            if(A[M[i][j - 1]] < A[M[i + (1 << (j - 1))][j - 1]])
                M[i][j] = M[i][j - 1];
            else
                M[i][j] = M[i + (1 << (j - 1))][j - 1];

    int p, x, y;
    for(int i = 1; i <= m; ++i) {
        fin >> x >> y;

        if(x == y) {
            fout << A[x] << '\n';
            continue;
        }
        p = 1;
        while(1 << (p + 1) <= y - x + 1) ++p;
        fout << min(A[M[x][p]], A[M[y - (1 << p) + 1][p]]) << '\n';
    }
    return 0;
}