#include<stdio.h>
#define nmax 100010
int a[nmax][20], log[nmax], n, m, i, j, x, y, k, rez;

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

void create ()
{	scanf("%d%d", &a[0][0], &a[1][0]);
	for(i=2; i<n; i++)
	{	scanf("%d", &a[i][0]);
		log[i]=log[i/2]+1;
	}	
	log[n]=log[n/2]+1;
	for(j=1; (1<<j)<=n; j++)
		for(i=0; i+(1<<j)<=n; i++)
			a[i][j]=(a[i][j-1]<a[i+(1<<(j-1))][j-1])?a[i][j-1]:a[i+(1<<(j-1))][j-1];
}

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