#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int MAX_N=100005;
const int lg=17;
int bin_log[MAX_N];
int mx[MAX_N][lg+1];
int n;
int m;
int query(int L,int R){
    int length=R-L+1;
    int k=bin_log[length];
    return min(mx[L][k],mx[R-(1<<k)+1][k]);
    
}

int main()
{
    fin>>n;
    fin>>m;
    for(int i=2;i<=n;i++){
        bin_log[i]=bin_log[i/2]+1;
    }
    for(int i=1;i<=n;i++)
    {
        fin>>mx[i][0];
    }
    for(int k=1;k<=lg;k++){
        for(int i=1;i<=(n-(1<<k)+1);i++)
            {
                mx[i][k]=min(mx[i][k-1],mx[i+(1<<(k-1))][k-1]);
            }
    }
    while(m--){
       int l,r;
       fin>>l>>r;
       fout<<query(l,r)<<'\n';
       
    }
    return 0;
}