#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define file(a) freopen(#a".in","r",stdin);freopen(#a".out","w",stdout)
using namespace std;
const int MAXN=4e5;
const int blk_sz=256;
const int LOG_B=8;
int n,qu,lst[MAXN+5],a[MAXN+5],bel[MAXN+5],dep[blk_sz*2+5],rev[blk_sz+5];
int res[MAXN+5],ql[MAXN+5],qr[MAXN+5];
vector<pii>qv[MAXN+5];
struct block{
	int L,R,len,b[blk_sz+5],c[2][blk_sz+5],tag,tot_xor[2];
	int coef[blk_sz+5],tot[2][blk_sz+5],nw[blk_sz+5];
	vector<int>vec[blk_sz+2];
	void trans(int *f,int *g){
		static int A[blk_sz*2+5],B[blk_sz*2+5];
		for(int i=0;i<blk_sz;i++)A[rev[i]|blk_sz]=f[i];
		for(int i=blk_sz-1;i;i--)A[i]=A[i<<1]^A[i<<1|1];
		for(int i=1;i<=blk_sz*2-1;i++)B[i]=B[i>>1]^(A[i]<<dep[i]);
		for(int i=0;i<blk_sz;i++)g[i]=B[rev[i]|blk_sz]^(f[i]*(blk_sz*2-1));
	}
	void pushdown(){
		if(!tag)return;
		for(int o=0;o<2;o++){
			trans(tot[o],nw);
			for(int k=1;k<=len;k++)c[o][k]^=nw[b[k]&(blk_sz-1)];
		}
		memset(tot,0,sizeof(tot));
		for(int k=1;k<=len;k++)b[k]+=tag;
		tag=0;
	}
	void rebuild(){
		for(int k=0;k<blk_sz;k++)vec[k].clear();
		for(int k=1;k<=len;k++)vec[b[k]&(blk_sz-1)].pb(k);
		memset(coef,0,sizeof(coef));
		static int tmp[blk_sz+5];
		for(int k=0;k<blk_sz;k++)tmp[k]=vec[k].size()&1;
		trans(tmp,coef);
	}
	void init(){tag=0;rebuild();}
	void add(int tim,int ql,int qr){
		pushdown();
		for(int k=ql;k<=qr;k++){
			c[tim][k]^=(b[k]^(b[k]+1));
			tot_xor[tim]^=(b[k]^(b[k]+1));
			++b[k];
		}
		rebuild();
	}
	void addwhole(int tim){
		int val=(blk_sz-1-tag)&(blk_sz-1);
		tot_xor[tim]^=coef[val];
		tot[tim][val]^=1;
		for(int p:vec[val]){
			c[tim][p]^=(b[p]+tag)^(b[p]+tag+1);
			tot_xor[tim]^=(b[p]+tag)^(b[p]+tag+1);
		}
		tag++;
	}
	int query(int tim,int ql,int qr){
		if(tag)pushdown(),rebuild();
		int res=0;
		for(int k=ql;k<=qr;k++)res^=c[tim][k];
		return res;
	}
	int querywhole(int tim){return tot_xor[tim];}
}B[MAXN/blk_sz+5];
int main(){
//	freopen("in.txt","r",stdin);
	scanf("%d%d",&n,&qu);
	for(int i=0;i<blk_sz;i++)rev[i]=(rev[i>>1]>>1)|((i&1)<<(LOG_B-1));
	for(int i=2;i<blk_sz*2;i++)dep[i]=dep[i>>1]+1;
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1,l,r;i<=qu;i++){scanf("%d%d",&l,&r);qv[r].pb(mp(l,i));}
	for(int i=1;i<=n;i++)ql[i]=lst[a[i]]+1,qr[i]=i,lst[a[i]]=i;
	int blk_cnt=(n-1)/blk_sz+1;
	for(int i=1;i<=blk_cnt;i++){
		int L=(i-1)*blk_sz+1,R=min(i*blk_sz,n);
		B[i].L=L;B[i].R=R;B[i].len=R-L+1;
		for(int j=L;j<=R;j++)bel[j]=i;
		B[i].init();
	}
	for(int i=1;i<=n;i++){
		int L=ql[i],R=qr[i];
		if(bel[L]==bel[R]){
			B[bel[L]].add(i&1,L-B[bel[L]].L+1,R-B[bel[L]].L+1);
		}else{
			B[bel[L]].add(i&1,L-B[bel[L]].L+1,B[bel[L]].len);
			B[bel[R]].add(i&1,1,R-B[bel[R]].L+1);
			for(int j=bel[L]+1;j<bel[R];j++)B[j].addwhole(i&1);
		}
		for(pii p:qv[i]){
			L=p.fi;R=i;
			if(bel[L]==bel[R]){
				res[p.se]=B[bel[L]].query(i&1,L-B[bel[L]].L+1,R-B[bel[L]].L+1);
			}else{
				res[p.se]^=B[bel[L]].query(i&1,L-B[bel[L]].L+1,B[bel[L]].len);
				res[p.se]^=B[bel[R]].query(i&1,1,R-B[bel[R]].L+1);
				for(int j=bel[L]+1;j<bel[R];j++)res[p.se]^=B[j].querywhole(i&1);
			}
		}
	}
	for(int i=1;i<=qu;i++)printf("%d\n",res[i]);
	return 0;
}