#include<algorithm>
#include<cstdio>
#define nmax 250005
using namespace std;
int n,m,a[20][nmax],power[nmax];
int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d %d",&n,&m);
	int i,j,k,x,y,dif,plus;
	for(i=2;i<=n;i++)
		power[i]=power[i/2]+1;
	for(i=1;i<=n;i++)
		scanf("%d",&a[0][i]);
	for(i=1;(1<<i)<=n;i++)
		for(j=1;j<=n-(1<<i)+1;j++)
		{
			k=1<<(i-1);
			a[i][j]=min(a[i-1][j],a[i-1][j+k]);
		}
	while(m--)
	{
		scanf("%d %d",&x,&y);
		dif=y-x+1;
		i=power[dif];
		plus=dif-(1<<i);
		printf("%d\n",min(a[i][x+plus],a[i][x]));
	}
	return 0;
}