#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const int N=1e5+8;
int q,Qj[N],n,Qo[N],a[N*2];
inline int Xor(int X,int Y)
{
	return X^Y;
}
int main()
{
	//freopen("1.in","r",stdin);
	ios::sync_with_stdio(0);
	cin>>n>>q;
	for(int i=1;i<=n;++i)
	{
		cin>>a[i];
		if(i%2==0)
		{
			Qo[i/2]=Xor(Qo[i/2-1],a[i]);
		//	cout<<Qo[i/2]<<" ";
		}
		else
		{
			Qj[i/2+1]=Xor(Qj[i/2],a[i]);
		//	cout<<Qj[i/2+1]<<" ";
		}
	}
	//cout<<"\n";
	int Left,Right;
	while(q--)
	{
		int ans;
		cin>>Left>>Right;
		if((Right-Left)%2==1)
		{
			cout<<0<<"\n";
		}
		else
		{
			if(Right%2)
			{
				ans=(Qj[Right/2+1]^Qo[Left/2]);
			}
			else
			{
				ans=Xor(Qo[Right/2],Qo[Left/2-1]);
			}
			cout<<ans<<"\n";
		}
	}
}