#include <bits/stdc++.h>

using ll = long long;

using namespace std;

int main()
{
    ll n,q;
    scanf("%lld%lld", &n, &q);

    vector<ll> a(n+1);
    a[0] = 0;
    for (int i = 1; i < n+1; ++i)
    {
        ll aa;
        scanf("%lld", &aa);
        a[i] = a[i-1]^aa;
    }

    ll l, r;
    vector<ll> res(q);
    for (int i = 0; i < q; ++i)
    {
        scanf("%lld%lld", &l, &r);
        res[i] = a[--l]^a[r];
    }

    for (int i = 0; i < q; ++i)
        printf("%lld\n", res[i]);

    return 0;
}