#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define mems(x, v) memset(x, v, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef long double wisdom;

const int N = 2e5 + 5;
int n, m, a[N];
namespace SGT {
	#define ls pos << 1
	#define rs pos << 1 | 1

	int mn[N << 2], mn2[N << 2], X[N << 2], cnt[N << 2][30], cmn[N << 2], add[N << 2];
	void pushup(int pos) {mn[pos] = min(mn[ls], mn[rs]), cmn[pos] = (mn[pos] == mn[ls]) * cmn[ls] + (mn[pos] == mn[rs]) * cmn[rs], mn2[pos] = min(mn[pos] == mn[ls] ? mn2[ls] : mn[ls], mn[pos] == mn[rs] ? mn2[rs] : mn[rs]), X[pos] = X[ls] ^ X[rs]; for (int i = 0; i < 30; i++) cnt[pos][i] = cnt[ls][i] + cnt[rs][i];}
	void lazy(int pos, int ad) {
		if (cmn[pos] & 1) X[pos] ^= mn[pos] ^ (mn[pos] + ad);
		for (int b = 0; b < 30; b++) cnt[pos][b] += cmn[pos] * (-(mn[pos] >> b & 1) + ((mn[pos] + ad) >> b & 1));
		mn[pos] += ad, add[pos] += ad;
	}
	void pushdown(int pos) {if (add[pos]) {if (mn[ls] <= mn[rs]) lazy(ls, add[pos]); if (mn[rs] <= mn[ls]) lazy(rs, add[pos]); add[pos] = 0;}}
	void build(int l, int r, int pos) {if (l == r) {int x; scanf("%d", &x); X[pos] = mn[pos] = x, cmn[pos] = 1, mn2[pos] = 2e9; for (int i = 0; i < 30; i++) cnt[pos][i] = (x >> i & 1); return;} int mid = (l + r) >> 1; build(l, mid, ls), build(mid + 1, r, rs), pushup(pos);}
	void update(int l, int r, int pos, int L, int R, int x) {if (mn[pos] >= x) return; if (L <= l && r <= R && mn2[pos] > x) return lazy(pos, x - mn[pos]); int mid = (l + r) >> 1; pushdown(pos); if (L <= mid) update(l, mid, ls, L, R, x); if (mid < R) update(mid + 1, r, rs, L, R, x); pushup(pos);}
	int qxor(int l, int r, int pos, int L, int R) {if (L <= l && r <= R) return X[pos]; int mid = (l + r) >> 1, ans = 0; pushdown(pos); if (L <= mid) ans ^= qxor(l, mid, ls, L, R); if (mid < R) ans ^= qxor(mid + 1, r, rs, L, R); return ans;}
	int qcnt(int l, int r, int pos, int L, int R, int b) {if (L <= l && r <= R) return cnt[pos][b]; int mid = (l + r) >> 1, ans = 0; pushdown(pos); if (L <= mid) ans += qcnt(l, mid, ls, L, R, b); if (mid < R) ans += qcnt(mid + 1, r, rs, L, R, b); return ans;}
}
int main() {
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	scanf("%d%d", &n, &m), SGT::build(1, n, 1);
	while (m--) {
		int op, l, r, x; scanf("%d%d%d%d", &op, &l, &r, &x);
		if (op == 1) SGT::update(1, n, 1, l, r, x);
		else {
			int s = SGT::qxor(1, n, 1, l, r) ^ x; if (!s) {puts("0"); continue;}
			int b = 31 - __builtin_clz(s);
			printf("%d\n", SGT::qcnt(1, n, 1, l, r, b) + (x >> b & 1));
		}
		//printf("A: "); for (int i = 1; i <= n; i++) printf("%d ", SGT::qxor(1, n, 1, i, i)); puts("");
	}
	return 0;
}