#include <fstream>

using namespace std;

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

int n, m, a, b, p, i, j;

int l[100005], A[105][100005];

int main(){
    fin >> n >> m;
    l[1] = 0;
    for (i=2; i<=n; i++){
        l[i] = l[i/2] + 1;
    }
    for (i=1; i<=n; i++){
        fin >> A[0][i];
    }
    for (i=1; i<=l[n]+1; i++){
        for (j=1; j<=n; j++){
            A[i][j] = A[i-1][j];
            if (j + (1<<(i-1)) <= n){
                A[i][j] = min (A[i][j], A[i-1][j + (1<<(i-1))]);
            }
        }
    }
    for (i=1; i<=m; i++){
        fin >> a >> b;
        p = l[b-a+1];
        fout << min (A[p][a], A[p][b-(1<<p)+1]) << "\n";
    }
    return 0;
}