#include<cstdio>

#include<cstring>

#include<cctype>

#include<cstdlib>

#include<algorithm>

#define mid ((l+r)>>1)

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

long long rt[];

long long ls[];

long long rs[];

long long sum[];

long long q[];

long long s[];

int tot;

void build(long long &o,int l,int r){

    o=++tot;    sum[o]=;

    if(l==r)    return;

    build(ls[o],l,mid);

    build(rs[o],mid+,r);

}

void update(long long &o,int l,int r,long long last,long long p){

    o=++tot;

    ls[o]=ls[last];    rs[o]=rs[last];    sum[o]=sum[last]+;

    if(l==r)    return;

    if(p<=mid)    update(ls[o],l,mid,ls[last],p);

    else        update(rs[o],mid+,r,rs[last],p);

}

int query(int from,int to,int l,int r,int p){

    if(l==r)    return l;

    if(*(sum[ls[to]]-sum[ls[from]])>p)    return query(ls[from],ls[to],l,mid,p);

    if(*(sum[rs[to]]-sum[rs[from]])>p)    return query(rs[from],rs[to],mid+,r,p);

    return ;

}

int main(){

    int n=read(),m=read();

    for(int i=;i<=n;++i)    s[i]=q[i]=read();

    sort(s+,s+n+);

    int size=unique(s+,s+n+)-(s+);

    build(rt[],,size);

    for(int i=;i<=n;++i)    q[i]=lower_bound(s+,s+size+,q[i])-s;

    for(int i=;i<=n;++i)    update(rt[i],,size,rt[i-],q[i]);

    for(int i=;i<=m;++i){

        int from=read(),to=read();

        printf("%lld\n",s[query(rt[from-],rt[to],,size,to-from+)]);

    }

    return ;

}