#include <bits/stdc++.h>

using namespace std;

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

int n, m, i, j, k, a, b;
int l[25];
int d[25][100005];

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