#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
int a[maxn], b[maxn];
struct BIT {
  int c[maxn];
  void add(int loc, int val) {
    for (int i = loc; i < maxn; i += i & -i) c[i] ^= val;
  }
  int query(int loc) {
    int ans = 0;
    for (int i = loc; i; i -= i & -i) ans ^= c[i];
    return ans;
  }
  int seg(int l, int r) { return query(r) ^ query(l - 1); }
} B;
struct Basis {
  int c[34], sz;
  Basis() {
    memset(c, 0, sizeof(c));
    sz = 0;
  }
  void clear() {
    memset(c, 0, sizeof(c));
    sz = 0;
  }
  void ins(long long val) {
    for (int i = 32; i >= 0; i--) {
      if ((1ll << i) & val) {
        if (!c[i]) {
          c[i] = val;
          sz++;
          break;
        }
        val ^= c[i];
      }
    }
  }
  int cnt() { return 1 << sz; }
};
Basis merge(Basis a, Basis b) {
  for (int i = (0), iend = (32); i <= iend; i++)
    if (b.c[i]) a.ins(b.c[i]);
  return a;
}
struct segment_tree {
  Basis sum[maxn << 2];
  void push_up(int rt) { sum[rt] = merge(sum[(rt << 1)], sum[(rt << 1 | 1)]); }
  void build(int l, int r, int rt) {
    if (l == r) {
      sum[rt].ins(b[l]);
      return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, (rt << 1));
    build(mid + 1, r, (rt << 1 | 1));
    push_up(rt);
  }
  void upd(int l, int r, int rt, int tar, int val) {
    if (l == r) {
      sum[rt].clear();
      sum[rt].ins(val);
      return;
    }
    int mid = (l + r) >> 1;
    if (tar <= mid)
      upd(l, mid, (rt << 1), tar, val);
    else
      upd(mid + 1, r, (rt << 1 | 1), tar, val);
    push_up(rt);
  }
  Basis query(int l, int r, int rt, int tl, int tr) {
    if (tl <= l && r <= tr) return sum[rt];
    int mid = (l + r) >> 1;
    Basis res;
    if (tl <= mid) res = merge(res, query(l, mid, (rt << 1), tl, tr));
    if (tr >= mid + 1)
      res = merge(res, query(mid + 1, r, (rt << 1 | 1), tl, tr));
    return res;
  }
} t;
int main() {
  ios::sync_with_stdio(0);
  int n, q;
  cin >> n >> q;
  for (int i = (1), iend = (n); i <= iend; i++)
    cin >> a[i], b[i] = a[i] ^ a[i - 1], B.add(i, b[i]);
  t.build(1, n, 1);
  for (int i = (1), iend = (q); i <= iend; i++) {
    int ty, l, r, k;
    cin >> ty;
    if (ty == 1) {
      cin >> l >> r >> k;
      B.add(l, k), t.upd(1, n, 1, l, B.seg(l, l));
      if (r != n) B.add(r + 1, k), t.upd(1, n, 1, r + 1, B.seg(r + 1, r + 1));
    } else {
      cin >> l >> r;
      if (l == r) {
        Basis tmp;
        tmp.ins(B.seg(1, l));
        cout << tmp.cnt() << endl;
      } else {
        Basis ans = t.query(1, n, 1, l + 1, r);
        ans.ins(B.seg(1, l));
        cout << ans.cnt() << endl;
      }
    }
  }
  return 0;
}
