#include <bits/stdc++.h>
#define maxn 100005
using namespace std;
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (ch<'0'||ch>'9') {if (ch == '-') f = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {x = x * 10 + ch - 48; ch = getchar();}
	return x * f;
}
int f[maxn][31], lg[31];
int n, m;
int main() {
	n = read(), m = read();
	for (int i = 1; i <= n; i++) {
		f[i][0] = read();
		lg[i] = lg[i / 2] + 1;
	}
	for (int j = 1; j <= 30; j++) {
		for (int i = 1; i + (1 << j) - 1 <= n; i++) {
			f[i][j] = max(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
		} 
	}
	for (int i = 1, x, y, k; i <= m; i++) {
		cin >> x >> y;
		k = log2(y - x + 1);
		//cout << max(f[x][k], f[y - (1 << k) + 1][k]) << endl;
		printf("%d\n", max(f[x][k], f[y - (1 << k) + 1][k]));
	}
	return 0;
}