#include<bits/stdc++.h>
#define eps 1e-9
#define fi first
#define se second
#define pb push_back
#define db double
#define ll long long
#define PII pair<int,int >
#define mem(a,b) memset(a,b,sizeof(a)) 
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define int ll

using namespace std;

const int N = 2e5+10,M = 1005;
const int mod = 1e9+7,inf = 1e18;

struct Node{
	int l,r;
	int id;
}node[N];

int T,n,m,k;
int va[N];
int pos[N],siz;
int anw[N],ans;

map<int,int> cnt;
multiset<int > s;

bool cmp(Node A,Node B)
{
	if(pos[A.l]!=pos[B.l]) return pos[A.l]<pos[B.l];
	return A.r<B.r;
}

void add(int x)
{
	if(s.size()) s.erase(s.find(cnt[va[x]]));
	cnt[va[x]]++;
	s.insert(cnt[va[x]]);
}

void sub(int x)
{
	if(s.size()) s.erase(s.find(cnt[va[x]]));
	cnt[va[x]]--;
	s.insert(cnt[va[x]]);
}

signed main()
{
	IOS;
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>va[i];
	siz = sqrt(n);
	for(int i=1;i<=n;i++) pos[i] = i/siz;
	for(int i=1;i<=m;i++)
	{
		int a,b;
		cin>>a>>b;
		node[i] = {a,b,i};
	}
	sort(node+1,node+1+m,cmp);
	int l = 1,r = 0;
	for(int i=1;i<=m;i++)
	{
		while(l<node[i].l) sub(l++);
		while(l>node[i].l) add(--l);
		while(r<node[i].r) add(++r);
		while(r>node[i].r) sub(r--);
		anw[node[i].id] = *s.begin();
	}
	for(int i=1;i<=m;i++) cout<<-anw[i]<<"\n";
	return 0;
}