#include <cstdio>

const int NMAX = 100002 , LMAX = 18;
int rmq[LMAX][NMAX] , lg[NMAX] , v[NMAX] , N , M;

static inline int min(int a,int b)
{
	return a < b ? a : b;
}

int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d %d",&N,&M);
	lg[1] = 0;
	for(int i=1;i<=N;++i)
	scanf("%d",&v[i]) , rmq[0][i] = v[i] , lg[i+1] = lg[(i+1)/2] + 1;
	lg[N+1] = 0;
	for(int i=1;(1<<i)<=N;++i)
		for(int j=1;j<=N-(1<<i)+1;j++)
			rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
	for(int diff,sh,x,y,l;M;M--)
	{
		scanf("%d %d",&x,&y);
		l = lg[diff = y - x + 1];
		sh = diff - (1<<l);
		printf("%d\n",min(rmq[l][x],rmq[l][x + sh]));
	}
	return 0;
}