/*
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int MAXVAL=1e5;
const int putere=16;
int dp[putere+1][MAXVAL+1],log_2[MAXVAL+1];
//dp[j][i]-->minimul in intervalul
// [i,i+2^j-1]
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>dp[0][i];
    }
    for(int i=2;i<=n;i++){
        log_2[i]=log_2[i/2]+1;
    }
    for(int j=1;j<=log_2[n];j++){
        for(int i=1;i+(1<<(j))-1<=n;i++){
            dp[j][i]=min(dp[j-1][i],dp[j-1][i+(1<<(j-1))]);
        }
    }
        int a,b,l;
        for(int i=1;i<=m;i++){
            cin>>a>>b;
            l=log_2[b-a+1];
            cout<<min(dp[l][a],dp[l][b-(1<<(l))+1])<<'\n';
        }

      
}*/


#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int MAXVAL=1e5;
const int putere=16;
int dp[MAXVAL+1][putere+1],log_2[MAXVAL+1];
//dp[j][i]-->minimul in intervalul
// [i,i+2^j-1]
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>dp[i][0];
    }
    for(int i=2;i<=n;i++){
        log_2[i]=log_2[i/2]+1;
    }
    for(int i=n;i>=1;i--){
        for(int j=1;i+(1<<(j))-1<=n;j++){
               dp[i][j]=min(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
        }
    }
        int a,b,l;
        for(int i=1;i<=m;i++){
            cin>>a>>b;
            l=log_2[b-a+1];
            cout<<min(dp[a][l],dp[b-(1<<(l))+1][l])<<'\n';
        }

      
}