#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 19;
vector<int> V[N];
int a[N], b[N], s[N];
void push_up(vector<int> &a, vector<int> &b, vector<int> &c) {
  a = b;
  a.insert(a.end(), c.begin(), c.end());
  int j = 0;
  for (int i = 29; i >= 0; i--) {
    if (j == a.size()) return;
    for (int k = j + 1; k < a.size(); k++) {
      if (a[k] >> i & 1) {
        swap(a[j], a[k]);
        break;
      }
    }
    if (a[j] >> i & 1) {
      for (int k = j + 1; k < a.size(); k++)
        if (a[k] >> i & 1) a[k] ^= a[j];
      j++;
    }
  }
  a.resize(j);
}
void build(int u, int l, int r) {
  if (l == r) {
    if (b[l])
      V[u] = {b[l]};
    else
      V[u] = {};
    s[u] = b[l];
    return;
  }
  int mid = l + r >> 1;
  build(u + u, l, mid);
  build(u + u + 1, mid + 1, r);
  push_up(V[u], V[u + u], V[u + u + 1]);
  s[u] = s[u + u] ^ s[u + u + 1];
}
int query(int u, int l, int r, int ll, int rr) {
  if (ll <= l && r <= rr) return s[u];
  int mid = l + r >> 1, ret = 0;
  if (ll <= mid) ret ^= query(u + u, l, mid, ll, rr);
  if (mid < rr) ret ^= query(u + u + 1, mid + 1, r, ll, rr);
  return ret;
}
void update(int u, int l, int r, int p, int k) {
  if (l == r) {
    s[u] ^= k;
    if (s[u])
      V[u] = {s[u]};
    else
      V[u] = {};
    return;
  }
  int mid = l + r >> 1;
  if (p <= mid)
    update(u + u, l, mid, p, k);
  else
    update(u + u + 1, mid + 1, r, p, k);
  push_up(V[u], V[u + u], V[u + u + 1]);
  s[u] = s[u + u] ^ s[u + u + 1];
}
vector<int> ret, _ret;
void get(int u, int l, int r, int ll, int rr) {
  if (ll <= l && r <= rr) {
    push_up(_ret, ret, V[u]);
    ret = _ret;
    return;
  }
  int mid = l + r >> 1;
  if (ll <= mid) get(u + u, l, mid, ll, rr);
  if (mid < rr) get(u + u + 1, mid + 1, r, ll, rr);
}
int main() {
  int n, q;
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = a[i] ^ a[i - 1];
  build(1, 1, n);
  while (q--) {
    int t, l, r;
    scanf("%d%d%d", &t, &l, &r);
    if (t == 1) {
      int k;
      scanf("%d", &k);
      if (!k) continue;
      update(1, 1, n, l, k);
      if (r < n) update(1, 1, n, r + 1, k);
    } else {
      int x = query(1, 1, n, 1, l);
      if (x)
        ret = {x};
      else
        ret = {};
      if (l < r) get(1, 1, n, l + 1, r);
      printf("%d\n", 1 << ret.size());
    }
  }
  return 0;
}
