#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  vector<int> s(n + 1);
  for (int i = 0; i < n; ++i) {
    s[i + 1] = s[i] ^ a[i];
  }
  while (q--) {
    int l, r;
    cin >> l >> r;
    cout << (s[r] ^ s[l - 1]) << endl;
  }
  return 0;
}