#include <stdio.h>

const int N_MAX = 100010;
const int P_MAX = 17;

int v[N_MAX], lg[N_MAX];
int a[P_MAX][N_MAX];

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

int main()
{
	freopen("rmq.in", "r", stdin);
#ifndef _SCREEN_
	freopen("rmq.out", "w", stdout);
#endif

	int N, M;
	scanf("%d %d\n", &N, &M);
	for (int i = 1; i <= N; i ++) {
		scanf("%d\n", &v[i]);
		a[0][i] = v[i];
	}
	for (int i = 1; (1 << i) <= N; i ++) {
		for (int j = 1; j <= N; j ++) {
			a[i][j] = MIN(a[i - 1][j], a[i - 1][j + (1 << (i - 1))]);
		}
	}
	for (int i = 1, sh = 0; i <= N; i <<= 1, sh ++) {
		for (int j = i; j < (1 << (sh + 1)); j ++) lg[j] = sh;
	}

	int x, y;
	for (int m = 1; m <= M; m ++) {
		scanf("%d %d\n", &x, &y);
		int l = y - x + 1;

		printf("%d\n", MIN(a[lg[l]][x], a[lg[l]][x + (l - (1 << lg[l]))]));
	}

	return 0;
}