#include <cstdio>
#include <algorithm>
using namespace std;
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 << 3) + (x << 1) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
const int N = 5e5 + 10;
struct Node {
int l, r, cnt;
} tr[N << 5];
int root[N], idx;
int n, m;
void insert(int &u, int l, int r, int x) {
tr[++idx] = tr[u];
tr[u].cnt++;
u = idx;
if (l == r) return;
int mid = l + r >> 1;
if (x <= mid)
insert(tr[u].l, l, mid, x);
else
insert(tr[u].r, mid + 1, r, x);
}
int query(int p, int q, int l, int r, int x) {
if (l == r) return l;
int mid = l + r >> 1;
if (2 * (tr[tr[q].l].cnt - tr[tr[p].l].cnt) > x)
return query(tr[p].l, tr[q].l, l, mid, x);
if (2 * (tr[tr[q].r].cnt - tr[tr[p].r].cnt) > x)
return query(tr[p].r, tr[q].r, mid + 1, r, x);
return 0;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("P3567.in", "r", stdin);
#endif
n = read(), m = read();
for (int i = 1; i <= n; i++) {
int x = read();
root[i] = root[i - 1];
insert(root[i], 1, n, x);
}
while (m--) {
int l = read(), r = read();
printf("%d\n", query(root[l - 1], root[r], 1, n, r - l + 1));
}
return 0;
}