#include <bits/stdc++.h>
const int M = 200005;
int read() {
  int x = 0, flag = 1;
  char c;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') flag = -1;
  while (c >= '0' && c <= '9')
    x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  return x * flag;
}
int n, q;
struct node {
  int lv, rv, la, p[40];
  node() {
    lv = rv = la = 0;
    memset(p, 0, sizeof p);
  }
  void init() {
    lv = rv = la = 0;
    memset(p, 0, sizeof p);
  }
  void change(int v) {
    lv ^= v;
    rv ^= v;
    la ^= v;
  }
  void ins(int x) {
    if (!x) return;
    for (int i = 30; i >= 0; i--) {
      if (!(x >> i & 1)) continue;
      if (!p[i]) {
        p[i] = x;
        return;
      }
      x ^= p[i];
    }
  }
  int count() {
    int ans = 0;
    for (int i = 30; i >= 0; i--)
      if (p[i]) ans++;
    return ans;
  }
  node operator+(const node &b) const {
    node ans;
    for (int i = 0; i <= 30; i++) {
      ans.ins(p[i]);
      ans.ins(b.p[i]);
    }
    ans.ins(rv ^ b.lv);
    ans.lv = lv;
    ans.rv = b.rv;
    return ans;
  }
} tr[4 * M], rt;
void down(int i) {
  if (!tr[i].la) return;
  tr[i << 1].change(tr[i].la);
  tr[i << 1 | 1].change(tr[i].la);
  tr[i].la = 0;
}
void upd(int i, int l, int r, int L, int R, int v) {
  if (l > R || L > r) return;
  if (L <= l && r <= R) {
    tr[i].change(v);
    return;
  }
  down(i);
  int mid = (l + r) >> 1;
  upd(i << 1, l, mid, L, R, v);
  upd(i << 1 | 1, mid + 1, r, L, R, v);
  tr[i] = tr[i << 1] + tr[i << 1 | 1];
}
void query(int i, int l, int r, int L, int R) {
  if (l > R || L > r) return;
  if (L <= l && r <= R) {
    rt = rt + tr[i];
    return;
  }
  down(i);
  int mid = (l + r) >> 1;
  query(i << 1, l, mid, L, R);
  query(i << 1 | 1, mid + 1, r, L, R);
}
signed main() {
  n = read();
  q = read();
  for (int i = 1; i <= n; i++) upd(1, 1, n, i, i, read());
  for (int i = 1; i <= q; i++) {
    int op = read();
    if (op == 1) {
      int l = read(), r = read(), v = read();
      upd(1, 1, n, l, r, v);
    } else {
      int l = read(), r = read();
      rt.init();
      query(1, 1, n, l, r);
      printf("%d\n", 1 << rt.count());
    }
  }
}
