#include <bits/stdc++.h>
using namespace std;
struct Node {
	int mn, mn2, cnt, sum, val[30], tag;
} t[200005 * 4];
int n, q, a[200005];
int min(int x, int y) {
	return x < y ? x : y;
}
void up(int p) {
	t[p].sum = t[p << 1].sum ^ t[p << 1 | 1].sum;
	t[p].mn = min(t[p << 1].mn, t[p << 1 | 1].mn);
	t[p].cnt = 0;
	if (t[p << 1].mn == t[p].mn) t[p].cnt += t[p << 1].cnt;
	if (t[p << 1 | 1].mn == t[p].mn) t[p].cnt += t[p << 1 | 1].cnt;
	t[p].mn2 = 2e9;
	if (t[p << 1].mn != t[p].mn) t[p].mn2 = min(t[p].mn2, t[p << 1].mn);
	if (t[p << 1].mn2 != t[p].mn) t[p].mn2 = min(t[p].mn2, t[p << 1].mn2);
	if (t[p << 1 | 1].mn != t[p].mn) t[p].mn2 = min(t[p].mn2, t[p << 1 | 1].mn);
	if (t[p << 1 | 1].mn2 != t[p].mn) t[p].mn2 = min(t[p].mn2, t[p << 1 | 1].mn2);
	for (int i = 0; i < 30; ++i)
		t[p].val[i] = t[p << 1].val[i] + t[p << 1 | 1].val[i];
}
void down(int p) {
	if (t[p].tag != -1) {
		int tmp = min(t[p << 1].mn, t[p << 1 | 1].mn);
		if (t[p << 1].mn == tmp) {
			if (t[p << 1].cnt & 1) {
				t[p << 1].sum ^= t[p << 1].mn;
				t[p << 1].sum ^= t[p].tag;
			}
			for (int i = 0; i < 30; ++i)
				if (t[p << 1].mn >> i & 1)
					t[p << 1].val[i] -= t[p << 1].cnt;
			t[p << 1].tag = t[p].tag;
			t[p << 1].mn = t[p].tag;
			for (int i = 0; i < 30; ++i)
				if (t[p << 1].mn >> i & 1)
					t[p << 1].val[i] += t[p << 1].cnt;
		}
		if (t[p << 1 | 1].mn == tmp) {
			if (t[p << 1 | 1].cnt & 1) {
				t[p << 1 | 1].sum ^= t[p << 1 | 1].mn;
				t[p << 1 | 1].sum ^= t[p].tag;
			}
			for (int i = 0; i < 30; ++i)
				if (t[p << 1 | 1].mn >> i & 1)
					t[p << 1 | 1].val[i] -= t[p << 1 | 1].cnt;
			t[p << 1 | 1].tag = t[p].tag;
			t[p << 1 | 1].mn = t[p].tag;
			for (int i = 0; i < 30; ++i)
				if (t[p << 1 | 1].mn >> i & 1)
					t[p << 1 | 1].val[i] += t[p << 1 | 1].cnt;
		}
		t[p].tag = -1;
	}
}
void build(int p, int l, int r) {
	t[p].tag = -1;
	if (l == r) {
		t[p].sum = a[l];
		t[p].mn = a[l];
		t[p].cnt = 1;
		t[p].mn2 = 2e9;
		for (int i = 0; i < 30; ++i)
			if (a[l] >> i & 1)
				t[p].val[i] = 1;
		return;
	}
	int mid = l + r >> 1;
	build(p << 1, l, mid);
	build(p << 1 | 1, mid + 1, r);
	up(p);		
}
void modify(int p, int l, int r, int L, int R, int x) {
	if (l > R || L > r || L > R || t[p].mn >= x) return;
	if (L <= l && r <= R && t[p].mn2 > x) {
		if (t[p].cnt & 1) {
			t[p].sum ^= t[p].mn;
			t[p].sum ^= x;
		}
		for (int i = 0; i < 30; ++i)
			if (t[p].mn >> i & 1)
				t[p].val[i] -= t[p].cnt;
		t[p].tag = x;
		t[p].mn = x;
		for (int i = 0; i < 30; ++i)
			if (t[p].mn >> i & 1)
				t[p].val[i] += t[p].cnt;
		return;
	}
	down(p);
	int mid = l + r >> 1;
	modify(p << 1, l, mid, L, R, x);
	modify(p << 1 | 1, mid + 1, r, L, R, x);
	up(p);
}
int ask(int p, int l, int r, int L, int R) {
	if (l > R || L > r || L > R) return 0;
	if (L <= l && r <= R) return t[p].sum;
	down(p);
	int mid = l + r >> 1;
	return ask(p << 1, l, mid, L, R) ^ ask(p << 1 | 1, mid + 1, r, L, R);
}
int qry(int p, int l, int r, int L, int R, int d) {
	if (l > R || L > r || L > R) return 0;
	if (L <= l && r <= R) return t[p].val[d];
	down(p);
	int mid = l + r >> 1;
	return qry(p << 1, l, mid, L, R, d) + qry(p << 1 | 1, mid + 1, r, L, R, d);
}
int main() {
	scanf("%d%d", &n, &q);
	for (int i = 1; i <= n; ++i)
		scanf("%d", &a[i]);
	build(1, 1, n);
	while (q--) {
		int op, l, r, x;
		scanf("%d%d%d%d", &op, &l, &r, &x);
		if (op == 1) {
			modify(1, 1, n, l, r, x);
		} else {
			int sum = ask(1, 1, n, l, r) ^ x, d = -1;
			for (int i = 29; i >= 0; --i)
				if (sum >> i & 1) {
					d = i;
					break;
				}
			printf("%d\n", (x >> d & 1) + (d == -1 ? 0 : qry(1, 1, n, l, r, d)));
		}
	}
	return 0;
}