#include <cstdio>
#include <algorithm>

using namespace std;
int n, m;
int r[100001][21];
int go(int a, int b) {
	int pr = 1 << 21;
	int pos = 21;
	int ans = r[a][0];
	while (1) {
	if (pos <= -1) break;
	if (a + pr -1 > b) {pr>>=1;--pos; continue;}
	ans = min(ans, r[a][pos]);
	
	a+=pr;pr>>=1; --pos;
	}
	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[i][0]);
for (int i = 1; i < 21; ++i) 
for (int j = 1; j <= n; ++j) if (j - 1 + (1 << i) <= n ) 
{
	
	r[j][i] = min(r[j][i-1], r[j+(1<<(i-1))][i-1]);
}

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