#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

#define maxN 100010
#define max2 18

int RMQ[max2][maxN], Lg[maxN];

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

	for (int i = 2; i <= N; ++ i) Lg[i] = Lg[i / 2] + 1;
	
	while (M --)
	{
		int x, y;
		
		scanf ("%d %d", &x, &y);
		
		int nrE = y - x + 1;
		int K = Lg[nrE];
		
		printf ("%d\n", min (RMQ[K][x], RMQ[K][y - (1 << K) + 1]));
	}
	
	return 0;
}