#include<fstream>
#define maxn 100005
using namespace std;
ifstream fi("rmq.in");
ofstream fo("rmq.out");

int i,j,n,m,a[maxn],lg[maxn];
int x,y,z,rmq[maxn][18];
int st,lung;

int min(int a,int b){
    if(a<b) return a;
    else return b;
}

int main(){
    fi>>n>>m;
    for(i=1;i<=n;i++) fi>>a[i];
    
    lg[1]=0;
    for(i=2;i<=n;i++) lg[i]=lg[i/2]+1;
    
    
    for(i=1;i<=n;i++) rmq[i][0]=a[i];
     
    z=lg[n]; 
    for(j=1;j<=z;j++)
      for(i=1;i+(1<<j)-1<=n;i++)
        if(rmq[i][j-1]<rmq[i+(1<<(j-1))][j-1]) rmq[i][j]=rmq[i][j-1];
        else rmq[i][j]=rmq[i+(1<<(j-1))][j-1];
    
    
    for(;m>0;m--){
                  fi>>x>>y;
                  lung=y-x+1;
                  st=lg[lung];
                  fo<<min(rmq[x][st],rmq[y-(1<<st)+1][st])<<"\n";
                 }
    
    
    fi.close();
    fo.close();
    return 0;
}