#include<iostream>
#include<cstdio>
using namespace std;
int a[100000][30],m,n,v,u;
void find(int v,int u)
{
	int k=0;
	while((1<<(k+1))<=u-v+1)k++;
	printf("%d ",min(a[v][k],a[u-(1<<k)+1][k]));
}
int main()
{
	freopen("faithful.in","r",stdin);
	freopen("faithful.out","w",stdout);
	scanf("%d%d",&m,&n);
	for(int i=1;i<=m;i++)
	  scanf("%d",&a[i][0]);
	for(int i=1;(1<<i)<=m;i++)
	  for(int j=1;j+(1<<i)-1<=m;j++)
	    a[j][i]=min(a[j][i-1],a[j+(1<<(i-1))][i-1]);
	for(int i=1;i<=n;i++)
	{
	  scanf("%d%d",&v,&u);
	  find(v,u);
	}
	return 0;
}