#include <iostream>
#include <cstdio>
using namespace std;
int n, m, l, r, ans;
const int N = 200010;
int a[N], s[N], t[N], p[N], ji[N], ou[N];
inline int read() 
{
    int res = 0; char ch = getchar(); bool XX = false;
    for (; !isdigit(ch); ch = getchar())(ch == '-') && (XX = true);
    for (; isdigit(ch); ch = getchar())res = (res << 3) + (res << 1) + (ch ^ 48);
    return XX ? -res : res;
}
int main() 
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)a[i] = read();
    for (int i = 1; i <= n; ++i)s[i] = a[i] ^ s[i - 1];
    for (int i = 1; i <= n; ++i)t[i] = s[i] ^ t[i - 1];
    for (int i = 1; i <= n; ++i)p[i] = t[i] ^ p[i - 1];

    for (int i = 1; i <= n; ++i)
        if (i & 1)ji[i] = ji[i - 1] ^ s[i];
        else ji[i] = ji[i - 1];
    
    for (int i = 1; i <= n; ++i)
        if (!(i & 1))ou[i] = ou[i - 1] ^ s[i];
        else ou[i] = ou[i - 1];
    
    while (m--) 
    {
        l = read(); r = read(); ans = 0;
        if ((r - l + 1) & 1)ans = t[r];
        else ans = 0;

        ans ^= (p[r - 1] ^ p[l - 2]);

        if (!(r & 1))ans ^= ji[r - 1] ^ ji[max(l - 2, 0)];
        else ans ^= ou[r - 1] ^ ou[max(l - 2, 0)];
        printf("%d\n", ans);
    }
    return 0;
}