#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, q;
    cin >> n >> q;
    int a[n+1] = {};
    int sum[n+1] = {};
    srep(i,1,n+1){
        cin >> a[i];
        sum[i] = sum[i-1] ^ a[i];
    }
    rep(_,q){
        int l, r;
        cin >> l >> r;
        int ans = sum[r] ^ sum[l-1];
        cout << ans << endl;
    }
    return 0;
}