#include<cstdio>
using namespace std;

int V[100],M[100][100],i,j,a,b,l,nr,rmq(int left,int right),log(int x) ;
void read(),solve(),process();

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",&V[i]);
}

void solve()
{
	process();
	for(;nr;nr--)
	{
		scanf("%d%d",&a,&b);
		printf("%d\n",rmq(a,b));
	}
}

int rmq(int left,int right)
{
	int k;
	k=log(right-left+1);
	if(V[M[left][k]]<=V[M[right-(1<<k)+1][k]])
		return M[left][k];
	else return M[right-(1<<k)+1][k];
}

int log(int x)
{
	int l=0,r=32,m;
	for(;l+1<r;)
	{
		m=(l+r)/2;
		if((1<<m) ==x)return m;
		if( (1<<m) >=x)
			r=m;
		else
			l=m;
	}
	return ((l+r)/2);
}

void process()
{
	for(i=1;i<=l;i++)
		M[i][0]=i;
	for(j=1;1<<j<=l;j++)
		for(i=1;i + (1 << j) - 1 <= l; i++)
			if(V[M[i][j-1]]<=V[M[i+(1<<(j-1))][j-1]])
				M[i][j]=M[i][j-1];
			else
				M[i][j]=M[i+ (1<<(j-1))][j-1];
/*	for(i=1;i<=l;i++)
	{
		for(j=0;j<=l;j++)
			printf("%d ",M[i][j]);
		printf("\n");
	}*/
}