#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 10;
int f[N][16];
int a[N];
int lg[N];
int n, m;

signed main() {
	scanf("%lld%lld", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%lld", &f[i][0]);
	}
	lg[1] = 0;
	for (int i = 2; i <= n; i++) {
		lg[i] = lg[i >> 1] + 1;
	}
	for (int j = 1; j <= lg[n]; j++) {
		for (int i = 1; i <= n - (1 << j) + 1; i++) {
			f[i][j] = max(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
		}
	}
	int l, r;
	while (m--) {
		scanf("%lld%lld", &l, &r);
		int k = lg[r - l + 1];
		printf("%lld\n", max(f[l][k], f[r - (1 << k) + 1][k]));
	}
}