#include<stdio.h>
#define N_MAX 131072
#define logN_MAX 17

int M[logN_MAX+1][N_MAX];

inline int min(int a, int b)
{
	if (a<=b) return a;
	return b;
}

int main()
{
	freopen("rmq.in", "r", stdin);
	freopen("rmq.out", "w", stdout);
	
	int i, j, n, m, a, b, k, h;
	scanf("%d %d", &n, &m);
	for (i=1; i<=n; i++)
		scanf("%d", &M[1][i]);
	for (i=2, k=2; k<=n; i++, k<<=1)
		for (j=1; j<=n; j++)
		{
			M[i][j]=min(M[i-1][j], M[i-1][j+k/2]);
		}
	for (i=1; i<=m; i++)
	{
		scanf("%d %d", &a, &b);
		k=1; h=1; while(k<<1<=b-a+1) {k<<=1; h++;}
		printf("%d \n", min(M[h][a], M[h][b-k+1]));
	}
	fclose(stdout);
	return 0;
}