#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
const int MAXN=100000+10;
int n,m,A[MAXN][30],a,minn; 
void init()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	 scanf("%d",&A[i][0]);
	for(int j=1;(1<<j)<=n;j++)
	 for(int i=1;i+(1<<j)-1<=n;i++){
	 	A[i][j]=min(A[i+(1<<(j-1))][j-1],A[i][j-1]);
	 }
}
int que(int l,int r){
	int k=0;
	while((1<<(k+1))<=r-l+1)k++;
	minn=min(A[l][k],A[r-(1<<k)+1][k]);
	return minn;
}
int main()
{
//	freopen("","",std);
	freopen("faithful.in","r",stdin);freopen("faithful.out","w",stdout);
	init();
	int l,r;
	for(int o=1;o<=m;o++)
	 {
	 	scanf("%d%d",&l,&r);
	 	a=que(l,r);
	 	printf("%d\n",a);
	 }
	return 0;
}