#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e5+5,M=3e5+5,K=(1<<15)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,A[N];
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++) scanf("%d",&A[i]);
	int k=m;
	while(m--){
		int op,l,r,x;scanf("%d%d%d%d",&op,&l,&r,&x);
		if(op==1){
			if(k-m>1000) continue;
			for(i=l;i<=r;i++) A[i]=max(A[i],x);
		}else{
			if(k-m>1000){puts("0");continue;}
			int tot=x;
			for(i=l;i<=r;i++) tot^=A[i];
			if(!tot){puts("0");continue;}
			int ans=0,y=__lg(tot);for(i=l;i<=r;i++) if(A[i]>>y&1) ans++;ans+=(x>>y&1);
			printf("%d\n",ans);
		}
	}
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}