#include<cstdio>
#include<math.h>
using namespace std;

int a[1000005],min[1005];

int main ()
{
	int n,p,i,m,minim,x,y,j;
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d",&n); scanf("%d",&m);
	p=sqrt(n);
	for (i=1; i<=n/p+2; i++)
		min[i]=2e9;
	for (i=1; i<=n; i++)
	{
		scanf("%d",&a[i]);
		if (a[i]<min[i/p+1])
			min[i/p+1]=a[i];
	}
	for (i=1; i<=m; i++)
	{
		scanf("%d%d",&x,&y);
		minim=2e9;
		for (j=x/p+2; j<=y/p; j++)
			if (min[j]<minim)
				minim=min[j];
		for (j=x; j<=p*(x/p+1); j++)
			if (a[j]<minim)
				minim=a[j];
		for (j=y; j>p*(y/p); j--)
			if (a[j]<minim)
				minim=a[j];
		printf("%d\n",minim);
	}
	return 0;
}