#include <bits/stdc++.h>

using namespace std;

const int BUFF_SIZE = 1 << 20;
char BUFF[BUFF_SIZE], *BB, *BE;
char gc() { return BB == BE ? (BE = (BB = BUFF) + fread(BUFF, 1, BUFF_SIZE, stdin), BB == BE ? EOF : *BB++) : *BB++; }
void read() {}
template<class T, class ...Ts>
void read(T &x, Ts &...args) {
  x = 0; char ch = 0, w = 0;
  while (ch < '0' || ch > '9') w |= ch == '-', ch = gc();
  while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ '0'), ch = gc();
  if (w) x = -x;
  read(args...);
}

const int N = 4e5;
const int W = 8;
const int B = 1 << W;
const int CNT = (N + B - 1) >> W;

int n, m;
int a[N + 5], las[N + 5];
int ans[N + 5];
vector<pair<int, int>> qry[N + 5];

struct SqrtDecompositon {
  int pos[N + 5];
  int a[N + 5], sav[N + 5], add[CNT + 5];
  bool vis[CNT + 5];
  int val[2][N + 5], sum[2][CNT + 5];
  int del[CNT + 5][B][2], tag[2][CNT + 5][B][2];
  int t0[B << 1], t1[B << 1];
  void build(int p) {
    int l = ((p - 1) << W) + 1, r = min(p << W, n);
    if (add[p]) {
      vis[p] = 1;
      for (int i = l; i <= r; ++i) a[i] += add[p];
      add[p] = 0;
    }
    if (vis[p]) {
      memset(t0, 0, sizeof t0), memset(t1, 0, sizeof t1);
      for (int i = l; i <= r; ++i) t0[B ^ (a[i] & (B - 1))] ^= 1;
      for (int i = 0; i < B; ++i) del[p][(B - 1) ^ i][1] = t0[B ^ i];
      for (int k = W - 1; k >= 0; --k)
        for (int i = 0; i < 1 << k; ++i)
          t0[(1 << k) ^ i] = t0[(2 << k) ^ i] ^ t0[(3 << k) ^ i];
      for (int k = 0; k < W; ++k)
        for (int i = 0; i < 1 << k; ++i)
          t1[(2 << k) ^ i] = t1[(3 << k) ^ i] = t1[(1 << k) ^ i] ^= t0[((2 << k) - 1) ^ i] << k;
      for (int i = 0; i < B; ++i) del[p][i][0] = t1[B ^ i] ^= t0[((B << 1) - 1) ^ i] << W;
      vis[p] = 0;
    }
    for (int op = 0; op < 2; ++op) {
      memset(t0, 0, sizeof t0), memset(t1, 0, sizeof t1);
      for (int i = 0; i < B; ++i) t0[((B << 1) - 1) ^ i] = ((t1[B ^ i] = tag[op][p][i][0]) << W) ^ tag[op][p][i][1];
      for (int i = 0; i < B; ++i) tag[op][p][i][0] = tag[op][p][i][1] = 0;
      for (int k = W - 1; k >= 0; --k)
        for (int i = 0; i < 1 << k; ++i)
          t0[((2 << k) - 1) ^ i] ^= (t1[(1 << k) ^ i] = t1[(2 << k) ^ i] ^ t1[(3 << k) ^ i]) << k;
      for (int k = 0; k < W; ++k)
        for (int i = 0; i < 1 << k; ++i)
          t0[(2 << k) ^ i] ^= t0[(1 << k) ^ i], t0[(3 << k) ^ i] ^= t0[(1 << k) ^ i];
      sum[op][p] = 0;
      for (int i = l; i <= r; ++i) sum[op][p] ^= val[op][i] ^= t0[B ^ (sav[i] & (B - 1))];
    }
    for (int i = l; i <= r; ++i) sav[i] = a[i];
  }
  void update(bool op, int l, int r) {
    for (int i = l; i <= min(pos[l] << W, r); ++i) val[op][i] ^= (a[i] + add[pos[l]]) ^ (a[i] + add[pos[l]] + 1), ++a[i];
    vis[pos[l]] = 1, build(pos[l]);
    if (pos[l] == pos[r]) return ;
    for (int i = ((pos[r] - 1) << W) + 1; i <= r; ++i) val[op][i] ^= (a[i] + add[pos[r]]) ^ (a[i] + add[pos[r]] + 1), ++a[i];
    vis[pos[r]] = 1, build(pos[r]);
    for (int p = pos[l] + 1; p < pos[r]; ++p) {
      int l = ((p - 1) << W) + 1, r = p << W;
      if (((a[l] + add[p] + 1) ^ (a[r] + add[p])) >> W) {
        int v = (a[l] + add[p] + 1) >> W; v = (v ^ (v - 1) ^ 1) << W;
        if (del[p][add[p] & (B - 1)][1]) sum[op][p] ^= v;
        tag[op][p][add[p] & (B - 1)][1] ^= v;
      }
      sum[op][p] ^= del[p][add[p] & (B - 1)][0], tag[op][p][add[p] & (B - 1)][0] ^= 1, ++add[p];
    }
  }
  int query(bool op, int l, int r) {
    int ret = 0;
    build(pos[l]);
    for (int i = l; i <= min(pos[l] << W, r); ++i) ret ^= val[op][i];
    if (pos[l] == pos[r]) return ret;
    build(pos[r]);
    for (int i = ((pos[r] - 1) << W) + 1; i <= r; ++i) ret ^= val[op][i];
    for (int p = pos[l] + 1; p < pos[r]; ++p) ret ^= sum[op][p];
    return ret;
  }
  void init() {
    for (int i = 1; i <= n; ++i) pos[i] = (i + B - 1) >> W;
    for (int p = 1; p <= pos[n]; ++p) build(p);
  }
} sd;

int main() {
  read(n, m);
  for (int i = 1; i <= n; ++i) read(a[i]);
  for (int i = 1; i <= m; ++i) {
    int l, r; read(l, r), qry[r].emplace_back(l, i);
  }
  sd.init();
  for (int i = 1; i <= n; ++i) {
    sd.update(i & 1, las[a[i]] + 1, i), las[a[i]] = i;
    for (auto [l, id]: qry[i]) ans[id] = sd.query(i & 1, l, i);
  }
  for (int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
}