#include <bits/stdc++.h>
#define nmax 100005
using namespace std;
string prob="rmq";
ifstream in(prob+".in");
ofstream out(prob+".out");
int lg[nmax],rmq[32][nmax],v[nmax];
int n,m;
void dolg(){
    for(int i=2;i<nmax;i++)lg[i]=lg[i>>1]+1;
}
void input(){
    in>>n>>m;
    for(int i=1;i<=n;i++){in>>v[i];rmq[0][i]=v[i];}
}
void dormq(){
    for(int i=1;(1<<i)<=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))]);
        }
    }
}
void processQueries(){
    int a,b;
    while(in>>a>>b){
        out<<min(rmq[lg[b-a+1]][a],rmq[lg[b-a+1]][b-(1<<lg[b-a+1])+1])<<'\n';
    }
}
int main(){
    dolg();
    input();
    dormq();
    processQueries();
}