#include <iostream>
#include <fstream>
#define nmax 100001
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m;
int L[nmax],RMQ[nmax][20],A[nmax];
void read(){
    f>>n>>m;
    for(int i=1;i<=n;i++){
        f>>RMQ[0][i];
    }
}
void rmq(){
    for(int i=1;(1<<i)<=n;i++){
        for(int j=1;j<=n-(1<<i)+1;j++){
            int p=1<<(i-1);;
            if(RMQ[i-1][j]<RMQ[i-1][j+p]){
                RMQ[i][j]=RMQ[i-1][j];
            }else{
                RMQ[i][j]=RMQ[i-1][j+p];
            }
        }
    }
    L[1]=0;
    for(int i=2;i<=n;i++){
        L[i]=L[i/2]+1;
    }
}
void solve(){
    int x,y;
    while(m--){
        f>>x>>y;
        int dif=y-x+1;
        int l=L[dif];
        int d=dif-(1<<l);
        g<<min(RMQ[l][x],RMQ[l][x+d])<<"\n";
    }
}
int main()
{
    read();
    rmq();
    solve();
    return 0;
}