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

int i,n,m,a[maxn],lg[maxn];
int x,y,rmq[maxn][18];

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

void logaritm(int x){
    int i; lg[1]=0;
    for(i=2;i<=n;i++) lg[i]=lg[i/2]+1;
}

void range_minimum_query(int n){
     int i,j,z=lg[n];
     
     for(i=1;i<=n;i++) rmq[i][0]=i;
     
     for(j=1;j<=z;j++)
       for(i=1;i+(1<<j)-1<=n;i++)
         if(a[rmq[i][j-1]]<a[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];
}

void query(int m){
     int st,lung;
     for(;m>0;m--){
                   fi>>x>>y;
                   lung=y-x+1;
                   st=lg[lung];
                   fo<<min(a[rmq[x][st]],a[rmq[y-(1<<st)+1][st]])<<"\n";
                  }
}

int main(){
    fi>>n>>m;
    for(i=1;i<=n;i++) fi>>a[i];
    
    logaritm(n);
    
    range_minimum_query(n);
    
    query(m);
    
    fi.close();
    fo.close();
    return 0;
}