#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
using namespace std;
#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}
#define N 4200005
#define inf 0x3f3f3f3f
int n,m,a[3000005],tot;
#define sum(p) (p?p->sum:0)
#define cnt(p) (p?p->cnt:0)
#define ml(p,v) (p?p->ml[v]:inf)
struct node{
	int l,r,sum,cnt,ml[2],ld[2],rd[2],qwq;
	bool v;node*ls,*rs;
	inline void pushup(){
		sum=sum(ls)+sum(rs)+(r-l+1)*v;
		cnt=cnt(ls)+cnt(rs)+v;
		ml[v]=min(min(ml(ls,v),ml(rs,v)),r-l+1);
		ml[!v]=min(ml(ls,!v),ml(rs,!v));
	}
	inline void pusht(int lld0,int lld1,int rrd0,int rrd1){
		ld[0]+=lld0,ld[1]+=lld1,rd[0]+=rrd0,rd[1]+=rrd1;
		ml[0]+=rrd0-lld0,ml[1]+=rrd1-lld1;
		sum+=(rrd1-lld1)*cnt;
		if(v)l+=lld1,r+=rrd1;
		else l+=lld0,r+=rrd0;
	}
	inline void pushdown(){
		if(!ld[0]&&! rd[0]&&! ld[1]&&! rd[1])return;
		if(ls)ls->pusht(ld[0], ld[1], rd[0], rd[1]);
		if(rs)rs->pusht(ld[0], ld[1], rd[0], rd[1]);
		ld[0]=rd[0]=ld[1]=rd[1]=0;
	}
};
node*rt;
node st[N];
inline node* newn(int l,int r,bool v){
    if(l>r)return NULL;
    node*p=&st[++tot];
	p->l=l,p->r=r,p->v=v;
	p->sum=(r-l+1)*v,p->cnt=v;
	p->ml[v]=r-l+1,p->ml[!v]=inf,p->qwq=rand();
    return p;
}

void splitl(node*p,int v,node*&x,node*&y)
{
	if(!p)return x=y=NULL,void();
	p->pushdown();
	if(p->r<v)x=p,splitl(p->rs,v,p->rs,y);
	else y=p,splitl(p->ls,v,x,p->ls);
	p->pushup();
}
void splitr(node*p,int v,node*&x,node*&y)
{
	if(!p)return x=y=NULL,void();
	p->pushdown();
	if(p->l<=v)x=p,splitr(p->rs,v,p->rs,y);
	else y=p,splitr(p->ls,v,x,p->ls);
	p->pushup();
}
node* merge(node* x,node* y){
	if(!x)return y; if(!y)return x;
	if(x->qwq < y->qwq)return x->pushdown(),x->rs=merge(x->rs,y),x->pushup(),x;
	return y->pushdown(),y->ls=merge(x,y->ls),y->pushup(),y;
}
inline node* findl(node* x){
    while(x->ls)x=x->ls;
	return x;
}
inline node* findr(node* x){
    while(x->rs)x=x->rs;
	return x;
}
void assign(int l,int r,bool v)
{
	node *x,*y,*z;
	splitl(rt,l,x,y),splitr(y,r,y,z);
	node *pl=findl(y),*pr=findr(y);
	if(pl->v==v)l=pl->l;
	else x=merge(x,newn(pl->l,l-1,pl->v));
	if(pr->v==v)r=pr->r;
	else z=merge(newn(r+1,pr->r,pr->v),z);
	if(x&&(pl=findr(x))->v==v) splitl(x,l=pl->l,x,pl);
	if(z&&(pr=findl(z))->v==v) r=pr->r,splitl(z,r+1,pr,z);
	rt=merge(merge(x,newn(l,r,v)),z);
}
void move(int l,int r,int ld0,int ld1,int rd0,int rd1,bool qwq)
{
	node *x,*y,*z;
	splitl(rt,l,x,y),splitr(y,r,y,z);
	node *pl=findl(y),*pr=findr(y);
	if(pl->v==qwq){
		splitr(y,pl->l,pl,y),x=merge(x,pl);
		if(!y)return rt=merge(x,z),void();
	}
	if(pr->v!=qwq){
		splitl(y,pr->l,y,pr),z=merge(pr,z);
		if(!y)return rt=merge(x,z),void();
	}
	y->pusht(ld0,ld1,rd0,rd1);
	rt=merge(merge(x,y),z);
}
inline int ask(int l,int r){
	node *x,*y,*z;int res;
	splitl(rt,l,x,y),splitr(y,r,y,z);
	node *pl=findl(y),*pr=findr(y);
	res=sum(y)-(l-pl->l)*pl->v-(pr->r-r)*pr->v;
	rt=merge(merge(x,y),z);
	return res;
}
void del(node* p){
	p->pushdown();
	if(p->l>p->r){
		node *x,*y,*z;
		if(p->l==1)return splitl(rt,1,x,rt);
		if(p->r==n)return splitr(rt,n,rt,x);
		splitl(rt,p->r,x,y),splitr(y,p->l,y,z);
		node *pl=findl(y),*pr=findr(y);
		rt=merge(merge(x,newn(pl->l,pr->r,pl->v)),z); 
		return;
	}
	if(min(ml(p->ls,0),ml(p->ls,1))==0) del(p->ls);
	else if(min(ml(p->rs,0),ml(p->rs,1))==0) del(p->rs);
}

int main()
{
	srand(2333);
	n=read(),m=read();
	int v=-1,lst=-1;
	For(i,1,n){
		a[i]=read();
		if(a[i]!=v){
			if(v>=0)rt=merge(rt,newn(lst,i-1,v));
			v=a[i],lst=i;
		}
	}
	rt=merge(rt,newn(lst,n,v));
//	print(rt),puts("");
	int res=0;
	For(_,1,m)
	{
		int op=read(),l=read()^res,r=read()^res;
		if(op<=2) assign(l,r,op-1);
		else if(op<=6){
			if(op==3) move(l,r, 0,-1,-1, 0,1);
			if(op==4) move(l,r, 1, 0, 0, 1,0);
			if(op==5) move(l,r,-1, 0, 0,-1,0);
			if(op==6) move(l,r, 0, 1, 1, 0,1);
		}else printf("%d\n",res=ask(l,r));
		if(op>=3){
			while(min(ml(rt,0),ml(rt,1))==0) del(rt);
		}
	}
    return 0;
}