#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=3e5+3;
const int M=N<<7;
int n,Q,a[N],rt[N],t[M],s[M][2],tt;
inline void mer(int &x,int y1,int y2,int l,int r,int nl,int nx){
	if(!y1&&!y2)return ;
	if(nl<=l&&r<nx){x=y1;return;}
	if(nx<=l){x=y2;return;}
	int m=(l+r)>>1;x=++tt;
	if(nl<=m)mer(s[x][0],s[y1][0],s[y2][0],l,m,nl,nx);
	mer(s[x][1],s[y1][1],s[y2][1],m+1,r,nl,nx);
	t[x]=t[s[x][0]]+t[s[x][1]];
}
inline void upd(int &x,int l,int r,int nx,int k){
	int p=++tt;t[p]=t[x]+k,s[p][0]=s[x][0],s[p][1]=s[x][1];x=p;
	if(l==r)return;int m=(l+r)>>1;
	nx<=m?upd(s[x][0],l,m,nx,k):upd(s[x][1],m+1,r,nx,k);
}
inline int qr(int x,int l,int r,int nr){
	if(!x)return 0;
	if(r<=nr)return t[x];int m=(l+r)>>1;
	return qr(s[x][0],l,m,nr)+(m<nr?qr(s[x][1],m+1,r,nr):0);
}
int main() {
    //freopen("data.in", "r", stdin);
     //freopen("myans.out","w",stdout);
	n=read(),Q=read();rep(i,1,n)a[i]=read();
	static int t[N];
	per(i,n,1){
		int T=t[a[i]];t[a[i]]=i;
		if(T){
			int k=qr(rt[i+1],1,n,T-1);
			mer(rt[i],rt[i+1],rt[T+1],1,n,i,T);
			upd(rt[i],1,n,i,1),upd(rt[i],1,n,T,-k-1);
		}
		else rt[i]=rt[i+1],upd(rt[i],1,n,i,1);
	}
	int lst=0;
	while(Q--){
		//lst=0;
		int l=read()^lst,r=read()^lst;
		printf("%d\n",lst=qr(rt[l],1,n,r));
	}
    return 0;
}