#include <bits/stdc++.h>
int n,m,i,j,lg[100005],a[100005][20],x,y,l;
using namespace std;
int main (){
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin.tie(0);
fin>>n>>m;
for(i=1;i<=n;i++) fin>>a[i][0];
for(j=1;(1<<j)<n;j++)
for(i=1;i+(1<<j)<=n+1;i++){
 a[i][j]=min(a[i][j-1],a[i+(1<<(j-1))][j-1]);
}
 
lg[1]=0;
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
while(m){
 fin>>x>>y;
 l=y-x; 
 l=lg[l];
 fout<<min(a[x][l],a[y-(1<<l)+1][l])<<'\n';
 m--;
}
return 0;
}