#include<bits/stdc++.h>
using namespace std;
const int MAXN=3e5+5;
struct SegmentTree {
	int tg[MAXN*100],ls[MAXN*100],rs[MAXN*100],m;
	void add(int ul,int ur,int k,int l,int r,int q,int &p) {
		if(ul<=l&&r<=ur) return tg[++m]=tg[q]+k,ls[m]=ls[q],rs[m]=rs[q],p=m,void();
		int mid=(l+r)>>1; tg[++m]=tg[p],ls[m]=ls[p],rs[m]=rs[p],p=m;
		k+=tg[p]-tg[q];
		if(ul<=mid) add(ul,ur,k,l,mid,ls[q],ls[p]);
		if(mid<ur) add(ul,ur,k,mid+1,r,rs[q],rs[p]);
	}
	int qry(int u,int l,int r,int p) {
		if(l==r) return tg[p];
		int mid=(l+r)>>1;
		return tg[p]+(u<=mid?qry(u,l,mid,ls[p]):qry(u,mid+1,r,rs[p]));
	}
}	T;
int n,q,rt[MAXN],a[MAXN],to[MAXN];
signed main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>q;
	for(int i=1;i<=n;++i) cin>>a[i],to[i]=n+1;
	for(int i=n;i>=1;--i) {
		rt[i]=rt[to[a[i]]+1],T.add(i,to[a[i]]-1,1,1,n,rt[i+1],rt[i]),to[a[i]]=i;
	}
	for(int l,r,lst=0;q--;) cin>>l>>r,l^=lst,r^=lst,cout<<(lst=T.qry(r,1,n,rt[l]))<<"\n";
	return 0;
}