#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::push(T &l, T &r)  should push the lazy update.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreeRange {
  int logN, n;
  vector<T> ts;
  SegmentTreeRange() : logN(0), n(0) {}
  explicit SegmentTreeRange(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreeRange(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void push(int u) {
    ts[u].push(ts[u << 1], ts[u << 1 | 1]);
  }
  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Applies T::f(args...) to [a, b).
  template <class F, class... Args>
  void ch(int a, int b, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return;
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) (ts[aa++].*f)(args...);
      if (bb & 1) (ts[--bb].*f)(args...);
    }
    for (int h = 1; h <= logN; ++h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) pull(aa);
      } else {
        if ((aa << h) != a) pull(aa);
        if ((bb << h) != b) pull(bb);
      }
    }
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (int h = logN; h; --h) push(a >> h);
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          push(a);
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (int h = logN; h; --h) push((b - 1) >> h);
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          push(b - 1);
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////

using U = unsigned long long;
constexpr int E = 64;
int LEN;

struct Node {
  int sz, cnt[E];
  U lz;
  Node() : sz(0), cnt{}, lz(0) {}
  void push(Node &l, Node &r) {
    if (lz) {
      l.flip(lz);
      r.flip(lz);
      lz = 0;
    }
  }
  void pull(const Node &l, const Node &r) {
    sz = l.sz + r.sz;
    for (int k = 0; k < LEN; ++k) {
      cnt[k] = l.cnt[k] + r.cnt[k];
    }
  }
  void flip(U val) {
    for (int k = 0; k < LEN; ++k) if (val >> k & 1) {
      cnt[k] = sz - cnt[k];
    }
  }
};

int N, Q;
vector<U> A;
vector<int> O, L, R;
vector<U> V;

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%llu", &A[i]);
    }
    O.assign(Q, -1);
    L.assign(Q, -1);
    R.assign(Q, -1);
    V.assign(Q, 0);
    for (int q = 0; q < Q; ++q) {
      scanf("%d", &O[q]);
      if (O[q] == 1) {
        scanf("%d%llu", &L[q], &V[q]);
        --L[q];
      } else if (O[q] == 2) {
        scanf("%llu", &V[q]);
      } else if (O[q] == 3) {
        scanf("%d%d", &L[q], &R[q]);
        --L[q];
        --R[q];
      } else {
        assert(false);
      }
    }
    
    vector<U> bit(N, 0);
    vector<U> ASum(N + 1, 0);
    SegmentTreeRange<Node> seg(N + 1);
    
    U basis[E] = {}, effects[E] = {}, masks[E] = {};
    int es[E] = {};
    auto build = [&]() -> void {
      for (int i = 0; i < N; ++i) {
        bit[i] = A[i];
      }
      for (int i = 0; i < N; ++i) {
        const int ii = i | (i + 1);
        if (ii < N) {
          bit[ii] ^= bit[i];
        }
      }
      for (int i = 0; i < N; ++i) {
        ASum[i + 1] = ASum[i] ^ A[i];
      }
      U on = 0;
      for (int e = 0; e < E; ++e) if (basis[e]) {
        on |= 1ULL << e;
      }
      LEN = 0;
      fill(effects, effects + E, 0);
      for (int e = 0; e < E; ++e) if (!basis[e]) {
        // modified[e] = original[e] \oplus (\bigoplus[f] (1 \oplus original[f])
        const int k = LEN++;
        effects[e] |= 1ULL << k;
        U mask = 1ULL << e;
        for (int f = e + 1; f < E; ++f) if (basis[f] >> e & 1) {
          effects[f] |= 1ULL << k;
          mask |= 1ULL << f;
        }
        es[k] = e;
        masks[k] = mask;
      }
// cerr<<"basis = ";pv(basis,basis+E);
// cerr<<"es = ";pv(es,es+LEN);
// cerr<<"masks = ";pv(masks,masks+LEN);
      for (int i = 0; i <= N; ++i) {
        auto &f = seg.at(i);
        f.sz = 1;
        f.lz = 0;
        for (int k = 0; k < LEN; ++k) {
          f.cnt[k] = __builtin_parityll((ASum[i] ^ on) & masks[k]);
        }
// cerr<<ASum[i]<<": ";pv(f.cnt,f.cnt+LEN);
      }
      seg.build();
    };
    build();
    for (int q = 0; q < Q; ++q) {
      if (O[q] == 1) {
        A[L[q]] ^= V[q];
        U val = 0;
        for (int e = 0; e < E; ++e) if (V[q] >> e & 1) {
          val ^= effects[e];
        }
        seg.ch(L[q] + 1, N + 1, &Node::flip, val);
      } else if (O[q] == 2) {
        U v = V[q];
        for (int e = 0; e < E; ++e) {
          chmin(v, v ^ basis[e]);
        }
        if (v) {
          const int e0 = 63 - __builtin_clzll(v);
          for (int e = 0; e < E; ++e) if (basis[e] >> e0 & 1) {
            basis[e] ^= v;
          }
          basis[e0] = v;
        }
        build();
      } else if (O[q] == 3) {
        U al = 0;
        for (int i = L[q]; i; i &= i - 1) {
          al ^= bit[i - 1];
        }
        auto res = seg.get(L[q] + 1, R[q] + 2);
        U val = 0;
        for (int e = 0; e < E; ++e) if (al >> e & 1) {
          val ^= effects[e];
        }
        res.flip(val);
// cerr<<"al = "<<al<<", val = "<<val<<endl;
        U ans = 0;
        for (int e = 0; e < E; ++e) if (basis[e]) {
          ans += ((U)res.sz << e);
        }
        for (int k = 0; k < LEN; ++k) {
          ans += ((U)res.cnt[k] << es[k]);
        }
        printf("%lld\n", ans);
      } else {
        assert(false);
      }
    }
  }
  return 0;
}