#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int NMAX=1e5;
const int LOGMAX=20;
int m[NMAX][LOGMAX];
void preprocesare(int v[], int n){
    for(int i=0; i<n; i++) m[i][0]=v[i];
    for(int j=1; j<=log2(n); j++){
        for(int i=0; i<n; i++){
            if(i+(1<<j)<=n) m[i][j]=min(m[i][j-1], m[i+(1<<(j-1))][j-1]);
        }
    }
}
int rmq(int x, int y){
    int p=log2(y-x+1);
    return min(m[x][p], m[y-(1<<p)+1][p]);
}
int main(){
    int n, m;
    in>>n>>m;
    int v[n];
    for(int i=0; i<n; i++){
        in>>v[i];
    }
    preprocesare(v, n);
    int x, y;
    for(int i=0; i<m; i++){
        in>>x>>y;
        x--; y--;
        out<<rmq(x,y)<<endl;
    }
    return 0;
}