#include <cstdio>
using namespace std;
#define nmax 100002
#define MIN(a,b) a<b?a:b
int a[20][nmax],n,m,l[nmax],x,y,d;
int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	int i,j;
	scanf("%d %d",&n,&m);
	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++)
			a[i][j]=MIN(a[i-1][j],a[i-1][j+(1<<(i-1))]);
	for(l[1]=0,i=2;i<=n;i++)
	{
		j=1;
		while((1<<j)<=i)
			j<<=1;
		j/=2;
		l[i]=j;
	}
	for(i=1;i<=m;i++)
	{
		scanf("%d%d", &x, &y);
		d=y-x+1;
		printf("%d\n", MIN(a[l[d]][x],a[l[d]][x+d-(1<<l[d])]));
	}
	return 0;
}