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

		while(x<=y)
		{
			for(dist=1;(1<<dist)<=y-x+1;dist++);
			dist--;
			sol=min(sol,a[dist][x]);

			x+=(1<<dist);
		}

		printf("%d\n",sol);
	}
	return 0;
}