#include<stdio.h>
#include<algorithm>
using namespace std;
int n,m;
int a[100003][18];
short lg[100003];
int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d\n",&a[i][0]);
	}
	for(int i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;
	for(int j=1;(1<<j)<=n;j++)
	{
		for(int i=1;i+(1<<j)-1<=n;i++)
			a[i][j]=min(a[i][j-1],a[i+(1<<(j-1))][j-1]);
	}
	for(int i=0;i<m;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		printf("%d\n",min(a[x][lg[y-x+1]],a[y-(1<<(lg[y-x+1]))+1][lg[y-x+1]]));
	}
	return 0;
}