#include<bits/stdc++.h>
using namespace std;
const int N=100001;
ifstream in("rmq.in");
ofstream out("rmq.out");
int d[20][N];
int n,v[N],p,k,m;

void constr(){
int i,j;
for(i=1;i<=n;i++)
d[0][i]=v[i];

p=1;

for(i=1;i<=n;i++,p*=2)
for(j=1;j<=n;j++)
    d[i][j]=min(d[i-1][j],d[i-1][j+p]);}


void rmq(int x,int y){
int w;
w=y-x;
k= log2(w);
p=pow(2,k);
out<<min(d[k][x],d[k][y+1-p])<<"\n";

}


int main(){
int i,x,y;
in>>n>>m;
for(i=1;i<=n;i++)
in>>v[i];
constr();

for(i=1;i<=m;i++){
    in>>x>>y;
    rmq(x,y);}

return 0;}