#include<stdio.h>
#define nmax 100
int rmq[nmax][20], log[nmax], n, m, i, j;

int min(int x, int y)
{	if(x<y)	return x;
	else	return y;
}

int main()
{	int x, y, k, rez;
	freopen("rmq.in", "r", stdin);
	freopen("rmq.out", "w", stdout);
	
	scanf("%d%d", &n, &m);
	for(i=1; i<=n; i++)	scanf("%d", &rmq[i][0]);
	for(i=2; i<=n; i++)	log[i]=log[i/2]+1;
	
	for(j=1; (1<<j)<=n; j++)
		for(i=1; i+(1<<j)<=n+1; i++)
			rmq[i][j]=min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
	
	for(i=1; i<=m; i++)
	{	scanf("%d%d", &x, &y);
		k=log[y-x+1];
		rez=min(rmq[x][k], rmq[y+1-(1<<k)][k]);
		printf("%d\n", rez);	
	}

	return 0;
	
}