#include <bits/stdc++.h>
using namespace std;
int fw[200005], n;
void upd(int idx, int v) {
  ++idx;
  while (idx <= n) {
    fw[idx] ^= v;
    idx += idx & -idx;
  }
}
int get(int idx) {
  ++idx;
  int v = 0;
  while (idx) {
    v ^= fw[idx];
    idx -= idx & -idx;
  }
  return v;
}
int N;
vector<int> t[2 << 18];
void insert(vector<int> &c, int x) {
  for (int &b : c) x = min(x, x ^ b);
  if (!x) return;
  for (int &b : c) b = min(b, b ^ x);
  c.emplace_back(x);
}
vector<int> operator+(vector<int> a, vector<int> b) {
  for (int x : b) insert(a, x);
  return a;
}
void update(int p, int k) {
  p += N;
  t[p][0] ^= k;
  for (p >>= 1; p > 0; p >>= 1) t[p] = t[p << 1 | 0] + t[p << 1 | 1];
}
vector<int> query(int l, int r) {
  vector<int> re;
  l += N;
  r += N;
  for (; l < r; l >>= 1, r >>= 1) {
    if (l & 1) re = re + t[l++];
    if (r & 1) re = re + t[--r];
  }
  return re;
}
int main() {
  int q, qt, l, r, k, x = 0, y;
  scanf("%d %d", &n, &q);
  for (N = n; N & (N - 1); N += N & -N)
    ;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &y);
    upd(i, y ^ x);
    t[N + i] = {y ^ x};
    x = y;
  }
  for (int i = N - 1; i > 0; --i) {
    t[i] = t[i << 1 | 0] + t[i << 1 | 1];
  }
  while (q--) {
    scanf("%d %d %d", &qt, &l, &r);
    --l;
    --r;
    if (qt == 1) {
      scanf("%d", &k);
      upd(l, k);
      upd(r + 1, k);
      update(l, k);
      if (r + 1 < n) update(r + 1, k);
    } else {
      vector<int> re = query(l + 1, r + 1);
      re = re + vector<int>{get(l)};
      printf("%u\n", 1 << re.size());
    }
  }
  return 0;
}
