#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 500010;

struct node {
  int len, cnt[64];
  node() { }
  node(ull x) {
    len = 1;
    rep (i, 0, 63) cnt[i] = (x >> i & 1);
  }
  friend node operator+(node x, node y) {
    node res;
    res.len = x.len + y.len;
    rep (i, 0, 63) res.cnt[i] = x.cnt[i] + y.cnt[i];
    return res;
  }
  void flip(ull x) {
    rep (i, 0, 63) if (x >> i & 1) cnt[i] = len - cnt[i];
  }
} t[maxn << 2];

int n, q, lz[maxn << 2];
ull a[maxn], s[maxn], c[64], lst[64];

struct fwt {
  ull t[maxn];
  void upd(int x, ull v) { while (x <= n) t[x] ^= v, x += x & (-x); }
  ull qry(int x) { ull res = 0; while (x) res ^= t[x], x -= x & (-x); return res; }
} fwt;

void ins(ull x) {
  per (i, 63, 0) if (x >> i & 1) {
    if (!c[i]) { c[i] = x; return; }
    x ^= c[i];
  }
}

ull qmx(ull x) {
  per (i, 63, 0) chkmx(x, x ^ c[i]);
  return x;
}

ull qmn(ull x) {
  per (i, 63, 0) chkmn(x, x ^ c[i]);
  return x;
}

void xiao() {
  per (i, 63, 0) {
    per (j, i - 1, 0) if (c[i] >> j & 1) c[i] ^= c[j];
  }
}

#define mid ((l + r) >> 1)

void build(int c, int l, int r) {
  lz[c] = 0;
  if (l == r) return t[c] = qmx(s[l]), void();
  build(c << 1, l, mid), build(c << 1 | 1, mid + 1, r);
  t[c] = t[c << 1] + t[c << 1 | 1];
}

void down(int c, int l, int r) {
  if (!lz[c]) return;
  lz[c << 1] ^= lz[c], t[c << 1].flip(lz[c]);
  lz[c << 1 | 1] ^= lz[c], t[c << 1 | 1].flip(lz[c]);
  lz[c] = 0;
}

void upd(int c, int l, int r, int x, int y, ll v) {
  if (l == x && r == y) return t[c].flip(v), lz[c] ^= v, void();
  down(c, l, r);
  if (y <= mid) upd(c << 1, l, mid, x, y, v);
  else if (x > mid) upd(c << 1 | 1, mid + 1, r, x, y, v);
  else upd(c << 1, l, mid, x, mid, v), upd(c << 1 | 1, mid + 1, r, mid + 1, y, v);
  t[c] = t[c << 1] + t[c << 1 | 1];
}

node qry(int c, int l, int r, int x, int y) {
  if (l == x && r == y) return t[c];
  down(c, l, r);
  if (y <= mid) return qry(c << 1, l, mid, x, y);
  else if (x > mid) return qry(c << 1 | 1, mid + 1, r, x, y);
  else return qry(c << 1, l, mid, x, mid) + qry(c << 1 | 1, mid + 1, r, mid + 1, y);
}

#undef mid

void rebuild() {
  rep (i, 1, n) s[i] = s[i - 1] ^ a[i];
  build(1, 1, n);
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> q;
  rep (i, 1, n) cin >> a[i], fwt.upd(i, a[i]);
  rebuild();
  while (q--) {
    int op, x, y;
    ull val;
    cin >> op;
    if (op == 1) {
      cin >> x >> val, a[x] ^= val, fwt.upd(x, val);
      upd(1, 1, n, x, n, qmn(val));
    } else if (op == 2) {
      cin >> val, memcpy(lst, c, sizeof(lst));
      ins(val), xiao();
      bool diff = 0;
      rep (i, 0, 63) if (c[i] != lst[i]) diff = 1;
      if (diff) rebuild();
    } else {
      cin >> x >> y, val = fwt.qry(x - 1), val = qmn(val);
      node res = qry(1, 1, n, x, y);
      ull ans = 0;
      rep (i, 0, 63) {
        int cnt = res.cnt[i];
        if (val >> i & 1) cnt = res.len - cnt;
        ans += ((1ull * cnt) << i);
      }
      cout << ans << '\n';
    }
  }
}