#include <bits/stdc++.h>
using namespace std;
namespace fastIO {
bool IOerror = 0;
inline char nc() {
  static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
  if (p1 == pend) {
    p1 = buf;
    pend = buf + fread(buf, 1, 100000, stdin);
    if (pend == p1) {
      IOerror = 1;
      return -1;
    }
  }
  return *p1++;
}
inline bool blank(char ch) {
  return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
inline void read(int &x) {
  char ch;
  while (blank(ch = nc()))
    ;
  if (IOerror) return;
  for (x = ch - '0'; (ch = nc()) >= '0' && ch <= '9'; x = x * 10 + ch - '0')
    ;
}
};  // namespace fastIO
using namespace fastIO;
const int maxn = 200005;
int base[maxn << 2][30], num[maxn << 2], n, q, a[maxn], b[maxn], A[66], B[31];
void Unite(int x, int y, int z) {
  int res = 0;
  for (int i = 1; i <= num[x]; i++) A[res++] = base[x][i];
  for (int i = 1; i <= num[y]; i++) A[res++] = base[y][i];
  memset(B, 0, sizeof(B));
  for (int i = 0; i < res; i++)
    for (int j = 29; j >= 0; j--)
      if (A[i] >> j & 1) {
        if (!B[j]) {
          B[j] = A[i];
          break;
        } else
          A[i] ^= B[j];
      }
  num[z] = 0;
  for (int i = 0; i <= 29; i++)
    if (B[i]) base[z][++num[z]] = B[i];
}
void build(int l, int r, int t) {
  if (l == r) {
    if (b[l]) base[t][++num[t]] = b[l];
    return;
  }
  int mid = (l + r) / 2;
  build(l, mid, (t << 1));
  build(mid + 1, r, ((t << 1) | 1));
  Unite((t << 1), ((t << 1) | 1), t);
}
void update(int x, int l, int r, int t, int val) {
  if (l == r) {
    base[t][1] ^= val;
    num[t] = (base[t][1] > 0);
    return;
  }
  int mid = (l + r) / 2;
  if (x <= mid)
    update(x, l, mid, (t << 1), val);
  else
    update(x, mid + 1, r, ((t << 1) | 1), val);
  Unite((t << 1), ((t << 1) | 1), t);
}
void query(const int o, const int l, const int r, const int L, const int R) {
  if (L > R) return;
  if (l > R || r < L) return;
  if (l >= L && r <= R) {
    Unite(0, o, 0);
    return;
  }
  int mid = l + r >> 1;
  query(o << 1, l, mid, L, R);
  query(o << 1 | 1, mid + 1, r, L, R);
}
int bit[maxn];
void add(int x, int val) {
  while (x <= n) {
    bit[x] ^= val;
    x += (x & (-x));
  }
}
int sum(int x) {
  int ans = 0;
  while (x) {
    ans ^= bit[x];
    x -= (x & (-x));
  }
  return ans;
}
int main() {
  read(n);
  read(q);
  for (int i = 1; i <= n; i++) read(a[i]);
  for (int i = 1; i < n; i++) b[i] = a[i] ^ a[i + 1];
  if (n > 1) build(1, n - 1, 1);
  while (q--) {
    int op, l, r, k;
    read(op);
    read(l);
    read(r);
    if (op == 1) {
      read(k);
      if (l > 1) update(l - 1, 1, n - 1, 1, k);
      if (r < n) update(r, 1, n - 1, 1, k);
      add(l, k);
      add(r + 1, k);
    } else {
      num[0] = 0;
      int temp = sum(l) ^ a[l];
      if (temp) base[0][++num[0]] = temp;
      if (n > 1) query(1, 1, n - 1, l, r - 1);
      printf("%d\n", 1 << num[0]);
    }
  }
}
