#include <cstdio>
#include <algorithm>

using namespace std;
int n, m;
int r[17][100001];
int go(int a, int b) {
	int pr = 1 << 17;
	int pos = 17;

	int ans = r[0][a];
	while (1) {
	if (pos <= 0) break;
	if (a + pr -1 > b) {pr>>=1;--pos; continue;}
	break;
	}
	ans = min(r[pos][a], r[pos][b-pr+1]);
	return ans;
}
int main() {
freopen("rmq.in", "r", stdin);
freopen("rmq.out", "w", stdout);
scanf("%d%d", &n, &m);

for (int i = 1; i <= n; ++i) scanf("%d", &r[0][i]);
for (int i = 1; i < 17; ++i) 
for (int j = 1; j - 1 + (1 << i)<= n; ++j)  
{
	
	r[i][j] = min(r[i-1][j], r[i-1][j+(1<<(i-1))]);
}

while (m--) {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", go(a, b));
}
return 0;
}