#include <bits/stdc++.h>
using ll = long long;
const int B = 500;

template <unsigned int k>
struct block {
  const static int v = (1 << k) - 1;
  std::array<int, 1 << k> sum, cnt[2];
  std::array<std::vector<int>, 1 << k> val;
  std::vector<int> ans[2], a;
  int tga[2], tgm;
  auto calc(std::array<int, 1 << k> a) {
    std::array<int, 1 << k> ret{};
    for (int i = k - 1; i >= 0; i--) {
      int t = (1 << (i + 1)) - 1;
      for (int j = 0; j <= t; j++)
        if (a[j]) ret[((1 << i) - 1 - j) & t] ^= t;
      for (int j = 0; j <= t; j++)
        if (j >> i & 1) a[j ^ (1 << i)] ^= a[j], ret[j] ^= ret[j ^ (1 << i)];
    }
    for (int i = 0; i < (int)k; i++) {
      for (int j = 0; j < (1 << (i + 1)); j++)
        if (j >> i & 1) ret[j] ^= ret[j ^ (1 << i)];
    }
    return ret;
  }
  void rebuild() {
    cnt[0] = cnt[1] = sum = {}, tgm = 0, val.fill({});
    for (int i = 0; i < (int)a.size(); i++) val[a[i] & v].push_back(i), sum[a[i] & v] ^= 1;
    sum = calc(sum);
  }
  int queryh(int t) { return tga[t]; }
  int query(int l, int r, int t) {
    assert(0 <= l && l <= r && r < (int)a.size());
    auto tmp = calc(cnt[t]);
    int ret = 0;
    for (int i = l; i <= r; i++)
      ret ^= ans[t][i], ret ^= tmp[a[i] & v];
    return ret;
  }
  void addh(int t) {
    for (int i : val[v - (tgm & v)]) 
      ans[t][i] ^= (a[i] + tgm) ^ (a[i] + tgm + 1), 
      tga[t] ^= (a[i] + tgm) ^ (a[i] + tgm + 1);
    tga[t] ^= sum[tgm & v], cnt[t][tgm & v] ^= 1;
    tgm += 1;
  }
  void add(int l, int r, int t) {
    assert(0 <= l && l <= r && r < (int)a.size());
    for (int t : {0, 1}) {
      auto tmp = calc(cnt[t]);
      for (int i = 0; i < (int)a.size(); i++) 
        ans[t][i] ^= tmp[a[i] & v];
    }
    for (int &x : a) x += tgm;
    for (int i = l; i <= r; i++) 
      ans[t][i] ^= a[i] ^ (a[i] + 1), tga[t] ^= a[i] ^ (a[i] + 1), a[i] += 1;
    rebuild();
  }
  block(std::vector<int> a) : a(a) {
    ans[0].assign(a.size(), 0), ans[1].assign(a.size(), 0), tga[0] = tga[1] = 0, rebuild();
  }
};
int main() {
  std::cin.tie(0)->sync_with_stdio(0);
  int n, q;
  std::cin >> n >> q;
  std::vector<int> a(n + 1), ans(q), bel(n + 1), st, ed;
  for (int i = 1; i <= n; i++) std::cin >> a[i];
  std::vector<block<8>> blk;
  for (int l = 1, r = B; l <= n; l = r + 1, r += B) {
    if (r > n) r = n;
    std::fill(bel.begin() + l, bel.begin() + r + 1, blk.size());
    blk.push_back(std::vector<int>(r - l + 1)), st.push_back(l), ed.push_back(r);
  }
  std::vector<std::vector<std::pair<int, int>>> que(n + 1);
  for (int i = 0; i < q; i++) {
    int l, r;
    std::cin >> l >> r;
    que[r].emplace_back(l, i);
  }
  auto add = [&](int l, int r, int t) {
    if (bel[l] == bel[r]) blk[bel[l]].add(l - st[bel[l]], r - st[bel[l]], t);
    else {
      blk[bel[l]].add(l - st[bel[l]], ed[bel[l]] - st[bel[l]], t);
      blk[bel[r]].add(st[bel[r]] - st[bel[r]], r - st[bel[r]], t);
      for (int i = bel[l] + 1; i < bel[r]; i++) blk[i].addh(t);
    }
  };
  auto query = [&](int l, int r, int t) {
    if (bel[l] == bel[r]) return blk[bel[l]].query(l - st[bel[l]], r - st[bel[l]], t);
    int ret = blk[bel[l]].query(l - st[bel[l]], ed[bel[l]] - st[bel[l]], t);
    ret ^= blk[bel[r]].query(st[bel[r]] - st[bel[r]], r - st[bel[r]], t);
    for (int i = bel[l] + 1; i < bel[r]; i++) ret ^= blk[i].queryh(t);
    return ret;
  };
  std::vector<int> lst(n + 1);
  for (int i = 1; i <= n; i++) {
    add(lst[a[i]] + 1, i, i & 1), lst[a[i]] = i;
    for (auto [l, id] : que[i]) ans[id] = query(l, i, i & 1);
    if (i % 5000 == 0) std::cerr << i << '\n';
  }
  for (int i = 0; i < q; i++) std::cout << ans[i] << '\n';
}