#include<cstdio>
using namespace std;

#define NMAX 100001
#define LOGMAX 17

int rmq[NMAX][LOGMAX];
int N;


int min(int a, int b) {
	return a > b ? b : a;
}

void buildTable() {	
	int P, i, j;
	for (P = 1, j = 1; P <= N; P<<=1, j++) {
		for (i = 1; i <= N-P; i++) {
			rmq[i][j] = min(rmq[i][j-1], rmq[i+1][j-1]);
		}
	}
}

int getMin(int start, int end) {
	if (start == end) return rmq[start][0];
	int P = 1;
	int i = 1;
	while (P + start < end) {
		P <<= 1;
		i++;
	}
	i--;
	P>>=1;
	return min(rmq[start][i], rmq[end - P][i]);
}

int main() {
	freopen("rmq.in", "r", stdin);
	freopen("rmq.out", "w", stdout);
	int M;
	scanf("%d %d", &N, &M);
	int i;
	for (i = 1; i <= N; i++) {
		scanf("%d", &rmq[i][0]);
	}

	buildTable();
	int a,b;
	for (i = 0; i < M; i++) {
		scanf ("%d %d", &a, &b);
		printf("%d\n", getMin(a,b));
	}

	return 0;
}