#include<bits/stdc++.h>
using namespace std;
constexpr int M=3e5+5;
struct segtree{int ls,rs,ans;}tr[M*160];
int n,q,l,r,num,lastans,a[M],mp[M],rt[M],nxt[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
int clone(int x){return tr[++num]=tr[x],num;}
void pushdown(int x){
	tr[x].ls=clone(tr[x].ls);
	tr[x].rs=clone(tr[x].rs);
	tr[tr[x].ls].ans+=tr[x].ans;
	tr[tr[x].rs].ans+=tr[x].ans;
	tr[x].ans=0;
}
void update(int now,int pre,int L,int R,int l=1,int r=n){
	if (L<=l&&r<=R) return tr[now]=tr[pre],tr[now].ans++,void();
	int mid=l+r>>1;pushdown(now);pushdown(pre);
	if (L<=mid) update(tr[now].ls,tr[pre].ls,L,R,l,mid);
	if (R>mid) update(tr[now].rs,tr[pre].rs,L,R,mid+1,r);
}
int query(int now,int u,int l=1,int r=n){
	if (!now) return 0;
	if (l==r) return tr[now].ans;
	int mid=l+r>>1;pushdown(now);
	if (u<=mid) return query(tr[now].ls,u,l,mid);
	return query(tr[now].rs,u,mid+1,r);
}
int main(){
	n=read();q=read();
	for (int i=1;i<=n;i++) a[i]=read(),mp[i]=n+1;
	for (int i=n;i;i--) nxt[i]=mp[a[i]],mp[a[i]]=i;
	for (int i=n;i;i--)
		rt[i]=clone(rt[nxt[i]+1]),
		update(rt[i],rt[i+1],i,nxt[i]-1);
	while (q--){
		l=read()^lastans;r=read()^lastans;
		printf("%d\n",lastans=query(rt[l],r));
	}
	return 0;
}