#include<cstdio>
#define min(a,b) a<b?a:b
using namespace std;
int M[20][100005],lg2[100002],i,j,a,b,k,l,nr;
void read(),solve();

int main()
{
	read();
	solve();
	return 0;
}

void read()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d%d",&l,&nr);
	for(i=1;i<=l;i++)
		scanf("%d",&M[0][i]);
	lg2[1]=0;
	for(i=2;i<l;i++)
		lg2[i]=lg2[1>>i]+1;
}

void solve()
{
	for(j=1;j<=17;j++)
	{
		for(i=1;i + (1 << j) - 1 <= l; i++)
			M[j][i]=min(M[j-1][i],M[j-1][i+(1<<(j-1))]);
	}
	for(;nr;nr--)
	{
		scanf("%d%d",&a,&b);
		k=lg2[b-a+1];
		printf("%d\n",min(M[k][a],M[k][b-(1<<k)+1]));
	}
}