#include<bits/stdc++.h>
#define ll long long
#define N 200005
using namespace std;
inline ll read(){
    ll x=0,f=1;char c=getchar();
    while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
    while(isdigit(c)){x=x*10+c-'0';c=getchar();}
    return x*f;
}
ll n,m,maxn,q[N],ans[N],cnt[N],sum,v[N];
struct query{
    ll l,r,id;
    bool operator<(const query &a)const{
        if(l/maxn!=a.l/maxn)return l<a.l;
        return (l/maxn)&1?r<a.r:r>a.r;
    }
}a[N];
void add(int i){
    v[cnt[i]]--;
    v[++cnt[i]]++;
    sum=max(sum,cnt[i]);
}
void del(int i){
    v[cnt[i]]--;
    if(cnt[i]==sum&&!v[cnt[i]--])sum--;
    v[cnt[i]]++;
}
void solve(){
    sort(a+1,a+m+1);
    for(int i=1,l=1,r=0;i<=m;i++){
        if(a[i].l==a[i].r){ans[a[i].id]=1;continue;}
        while(l>a[i].l)add(q[--l]);
        while(r<a[i].r)add(q[++r]);
        while(l<a[i].l)del(q[l++]);
        while(r>a[i].r)del(q[r--]);
        ans[a[i].id]=sum;
    }
}
int main(){
    ll len,d[N];n=read(),m=read(),maxn=sqrt(n);
    for(int i=1;i<=n;i++)d[i]=read();
    sort(d+1,d+n+1);len=unique(d+1,d+n+1)-d-1;
    for(int i=1;i<=n;i++)q[i]=lower_bound(d+1,d+len+1,q[i])-d;
    for(int i=1;i<=m;i++)a[i]=(query){read(),read(),i};
    solve();for(int i=1;i<=m;i++)printf("%lld\n",-ans[i]);
    return 0;
}

呜呜呜求各位大佬助一臂之力orzorz