#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e7 + 5, L = 0, R = 1;
struct lpl{
    int size, son[2];
}node[maxn];
int n, m, cnt, root[500005];

void build(int l, int r, int x, int &t, int val)
{
    t = ++cnt;
    node[t] = node[x]; node[t].size++;
    if(l == r) return;
    int mid = (l + r) >> 1;
    if(val <= mid) build(l, mid, node[x].son[L], node[t].son[L], val);
    else build(mid + 1, r, node[x].son[R], node[t].son[R], val);
}

inline int query(int A, int B)
{
    int x = root[A - 1], t = root[B], l = 1, r = n, tmp = (B - A + 1) >> 1;
    while(l < r){
        if(node[t].size - node[x].size <= tmp) return 0;
        int mid = (l + r) >> 1;
        if(node[node[t].son[L]].size - node[node[x].son[L]].size > tmp){
            r = mid; t = node[t].son[L]; x = node[x].son[L];
        }
        else if(node[node[t].son[R]].size - node[node[x].son[R]].size > tmp){
            l = mid + 1; t = node[t].son[R]; x = node[x].son[R];
        }
        else  return 0;
    }
    return l;
}

int main()
{
    int x, y; scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i){
        scanf("%d", &x); 
        build(1, n, root[i - 1], root[i], x);
    } 
    for(int i = 1; i <= m; ++i){
        scanf("%d%d", &x, &y);
        if(x > y) printf("0\n");
        printf("%d\n", query(x, y));
    }
    return 0;
}