#include<stdio.h>
int a[100020][20];
int v[100020];
int n,m,log[100020];
void logaritm()
{
	int x=1,y=0,i;
	for(i=1; i<=n; i++)
	{
		if(i<(x<<1))
			log[i]=y;
		else
		{
			x<<=1;
			log[i]=++y;
		}
	}
}
inline int min(int x,int y)
{
	if(x<y)
		return x;
	return y;
}
void calcul()
{
	int i,j;
	for(i=n; i; i--)
	{
		a[i][0]=v[i];
		for(j=1; i+(1<<j)<=n+1; j++)
			a[i][j]=min(a[i][j-1],a[i+(1<<(j-1))][j-1]);
	}
}
int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	int x,y,i,lung;
	scanf("%d%d",&n,&m);
	for(i=1; i<=n; i++)
		scanf("%d",&v[i]);
	//a[i][j]=min(v[i],v[i+1],...,v[i+2^j-1])
	//a[i][0]=v[i]
	//a[i][j]=min(a[i][j-1],a[i+2^(j-1)][j-1]),pt j>1 si idecrescator i+2^j<=n+1
	//min([x,y])=min(a[x][L],a[y-2^L+1][L]),unde L[lg(y-x+1)]
	logaritm();
	calcul();
	for(i=1; i<=m; i++)
	{
		scanf("%d%d",&x,&y);
		lung=log[y-x+1];
		printf("%d\n",min(a[x][lung],a[y-(1<<lung)+1][lung]));
	}
	return 0;
}