#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7, M = 30;
struct LB {
  int a[M + 1];
  void init() { memset(a, 0, sizeof(a)); }
  void ins(int x) {
    for (int i = M; i >= 0; --i)
      if (x >> i & 1)
        if (!a[i]) {
          a[i] = x;
          break;
        } else
          x ^= a[i];
  }
  int count(int res = 0) {
    for (int i = M; i >= 0; --i)
      if (a[i]) res++;
    return res;
  }
  LB operator+(LB b) {
    for (int i = M; i >= 0; --i)
      if (a[i]) b.ins(a[i]);
    return b;
  }
} t[N << 2], ans;
int n, m, a[N], b[N], bit[N], i, j, k, l;
void add(int x, int v) {
  while (x <= n) bit[x] ^= v, x += x & -x;
}
int sum(int x, int res = 0) {
  while (x) res ^= bit[x], x -= x & -x;
  return res;
}
void build(int rt, int l, int r) {
  if (l == r) {
    t[rt].ins(a[l]);
    return;
  }
  int mid = l + r >> 1;
  build((rt << 1), l, mid);
  build(((rt << 1) | 1), mid + 1, r);
  t[rt] = t[(rt << 1)] + t[((rt << 1) | 1)];
}
void update(int rt, int l, int r, int pos, int val) {
  if (l == r) {
    t[rt].init();
    a[l] ^= val;
    t[rt].ins(a[l]);
    return;
  }
  int mid = l + r >> 1;
  if (pos <= mid)
    update((rt << 1), l, mid, pos, val);
  else
    update(((rt << 1) | 1), mid + 1, r, pos, val);
  t[rt] = t[(rt << 1)] + t[((rt << 1) | 1)];
}
LB query(int rt, int l, int r, int a, int b) {
  if (a <= l && r <= b) return t[rt];
  int mid = l + r >> 1;
  LB res;
  res.init();
  if (a <= mid) res = query((rt << 1), l, mid, a, b);
  if (b > mid) res = res + query(((rt << 1) | 1), mid + 1, r, a, b);
  return res;
}
int main() {
  for (scanf("%d%d", &n, &m), i = 1; i <= n; ++i)
    scanf("%d", b + i), a[i] = b[i] ^ b[i - 1], add(i, a[i]);
  for (build(1, 1, n); m--;) {
    scanf("%d%d%d", &i, &j, &k);
    if (i == 1) {
      scanf("%d", &l);
      update(1, 1, n, j, l);
      add(j, l);
      if (k + 1 <= n) update(1, 1, n, k + 1, l), add(k + 1, l);
    } else {
      ans.init();
      if (j < k) ans = query(1, 1, n, j + 1, k);
      ans.ins(sum(j));
      printf("%lld\n", (1LL << ans.count()));
    }
  }
}
