#include<iostream>
#include<cstdio>
#include<set>
#define N 300000
using namespace std;
unsigned long long read()
{
	char c=0;
	unsigned long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
const int inf=(int)(1e9);
int n,m,length,st[N+1],leng;
struct reads
{
	int num,minn,data;
};
reads tong[N+1];
struct rds
{
	int l,r,type;
	bool operator < (const rds &t)const
	{
		return r<t.r;
	}
};
set<rds>sw[N+1];
struct seg
{
	struct node
	{
		int l,r,data,minn,cnt;
	    set<int>s;
		unsigned long long lazy,ans;
	};
	node tree[(N<<2)+1];
	void push_up(int k)
	{
		if (tree[k].l!=tree[k].r)
		{
			tree[k].minn=min(min(tree[k<<1].minn,tree[k<<1|1].minn),tree[k].data),tree[k].cnt=0;
			if (min(tree[k<<1].minn,tree[k].data)==tree[k].minn) tree[k].cnt+=(tree[k<<1].minn<tree[k].data?tree[k<<1].cnt:tree[k<<1].r-tree[k<<1].l+1);
			if (min(tree[k<<1|1].minn,tree[k].data)==tree[k].minn) tree[k].cnt+=(tree[k<<1|1].minn<tree[k].data?tree[k<<1|1].cnt:tree[k<<1|1].r-tree[k<<1|1].l+1);
			tree[k].ans=tree[k<<1].ans+tree[k<<1|1].ans;
		}
		else tree[k].minn=tree[k].data,tree[k].cnt=1;
		return;
	}
	void spread(int k,int minn)
	{
		if (tree[k].lazy)
		{
			if (min(tree[k<<1].minn,minn)==min(tree[k].minn,minn)) tree[k<<1].ans+=tree[k].lazy*(tree[k<<1].minn<minn?tree[k<<1].cnt:tree[k<<1].r-tree[k<<1].l+1),tree[k<<1].lazy+=tree[k].lazy;
			if (min(tree[k<<1|1].minn,minn)==min(tree[k].minn,minn)) tree[k<<1|1].ans+=tree[k].lazy*(tree[k<<1|1].minn<minn?tree[k<<1|1].cnt:tree[k<<1|1].r-tree[k<<1|1].l+1),tree[k<<1|1].lazy+=tree[k].lazy;
			tree[k].lazy=0;
		}
		return;
	}
	void build(int k,int l,int r)
	{
		tree[k].l=l,tree[k].r=r,tree[k].data=tree[k].minn=inf,tree[k].cnt=tree[k].r-tree[k].l+1;
		if (l==r) return;
		int mid=(l+r)>>1;
		build(k<<1,l,mid),build(k<<1|1,mid+1,r);
		return;
	}
	void add(int k,int l,int r,int x,int d,int minn)
	{
		if (tree[k].l==l&&tree[k].r==r)
		{
			if (tree[k].l!=tree[k].r) spread(k,minn);
			if (d==1) tree[k].s.insert(x);
			else tree[k].s.erase(x);
		    tree[k].data=(!tree[k].s.empty()?*tree[k].s.begin():inf),push_up(k);
			return;
		}
		spread(k,minn);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) add(k<<1,l,r,x,d,min(minn,tree[k].data));
		else if (l>=mid+1) add(k<<1|1,l,r,x,d,min(minn,tree[k].data));
		else add(k<<1,l,mid,x,d,min(minn,tree[k].data)),add(k<<1|1,mid+1,r,x,d,min(minn,tree[k].data));
		push_up(k);
		return;
	}
	void find(int k,int l,int r,int minn)
	{
		if (tree[k].l==l&&tree[k].r==r)
		{
			tong[++length]=(reads){k,minn,min(minn,tree[k].minn)};
			return;
		}
		st[++leng]=k,spread(k,minn);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) find(k<<1,l,r,min(minn,tree[k].data));
		else if (l>=mid+1) find(k<<1|1,l,r,min(minn,tree[k].data));
		else find(k<<1,l,mid,min(minn,tree[k].data)),find(k<<1|1,mid+1,r,min(minn,tree[k].data));
		return;
	}
	unsigned long long query(int k,int l,int r,int minn)
	{
		if (tree[k].l==l&&tree[k].r==r) return tree[k].ans;
		spread(k,minn);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) return query(k<<1,l,r,min(minn,tree[k].data));
		else if (l>=mid+1) return query(k<<1|1,l,r,min(minn,tree[k].data));
		else return query(k<<1,l,mid,min(minn,tree[k].data))+query(k<<1|1,mid+1,r,min(minn,tree[k].data));
	}
};
seg T;
void adder(int l,int r,int x,int type)
{
	rds top;
	for (auto it=sw[x].lower_bound((rds){0,l,type});it!=sw[x].end()&&(*it).l<=r;it=sw[x].lower_bound((rds){0,l,type}))
	{
		top=*it,sw[x].erase(it);
		if (!top.type) T.add(1,top.l,top.r,x,-1,inf);
		if (top.l<=l-1)
		{
			sw[x].insert((rds){top.l,l-1,top.type});
			if (!top.type) T.add(1,top.l,l-1,x,1,inf);
		}
		if (r+1<=top.r)
		{
			sw[x].insert((rds){r+1,top.r,top.type});
			if (!top.type) T.add(1,r+1,top.r,x,1,inf);
		}
	}
	sw[x].insert((rds){l,r,type});
	if (!type) T.add(1,l,r,x,1,inf);
	return;
}
int main()
{
	int op,l,r,x,minn;
	unsigned long long d;
	n=read(),m=read(),T.build(1,1,n);
	for (int i=1;i<=m;++i) adder(1,n,i,0);
	for (int i=1;i<=m;++i)
	{
		op=read();
		if (op==1) l=read(),r=read(),x=read(),adder(l,r,x,1);
		else if (op==2) l=read(),r=read(),x=read(),adder(l,r,x,0);
		else if (op==3)
		{
			l=read(),r=read(),d=read(),length=leng=0,T.find(1,l,r,inf),minn=inf;
			for (int j=1;j<=length;++j) minn=min(minn,tong[j].data);
			for (int j=1;j<=length;++j)
				if (tong[j].data==minn)
					T.tree[tong[j].num].ans+=d*(T.tree[tong[j].num].minn<tong[j].minn?T.tree[tong[j].num].cnt:T.tree[tong[j].num].r-T.tree[tong[j].num].l+1),T.tree[tong[j].num].lazy+=d;
			for (int j=leng;j>=1;--j) T.push_up(st[j]);
		}
		else l=read(),r=read(),printf("%llu\n",T.query(1,l,r,inf));
	}
	return 0;
}