#include <cstdio>
#include <algorithm>
#include <set>
#define ull unsigned long long
using namespace std;
const int N = 3e5 + 5;
int n,m,Q;
int a[1001][1001];
ull val[1001];
struct seg {
	int id[4001];
	void build(int now , int l , int r) {
		if(l == r) {id[now] = l;return;}
		int mid = l + r >> 1;
		build(now << 1 , l , mid);
		build(now << 1 | 1 , mid + 1 , r);
		id[now] = l;
	}
	void update(int now , int l , int r , int x , int val) {
		if(l == r) {
			if(val == 1)id[now] = m + 1;
			else id[now] = l;
			return;
		}
		int mid = l + r >> 1;
		if(x <= mid)update(now << 1 , l , mid , x , val);
		else update(now << 1 | 1 , mid + 1 , r , x ,val);
		id[now] = min(id[now << 1] , id[now << 1 | 1]);
	}
}T[1001];
struct question {
	int opt , l , r , x;
	ull v;
}q[N];
struct seg2 {
	int mn[N << 2],cnt[N << 2],in[N << 2][11];
	bool add[N << 2][11],del[N << 2][11];
	ull tag[N << 2],sum[N << 2];
	void build(int now , int l , int r) {
		mn[now] = 1;cnt[now] = r - l + 1;
		if(l == r)return;
		int mid = l + r >> 1;
		build(now << 1 , l , mid);
		build(now << 1 | 1 , mid + 1 , r);
	}
	void pushdown(int now , int l , int r) {
		int mid = l + r >> 1 , ls = now << 1 , rs = now << 1 | 1;
		if(mn[ls] == mn[now])tag[ls] += tag[now] , sum[ls] += tag[now] * cnt[ls];
		if(mn[rs] == mn[now])tag[rs] += tag[now] , sum[rs] += tag[now] * cnt[rs];
		tag[now] = 0;
		mn[ls] = mn[rs] = 11;cnt[ls] = cnt[rs] = r - l + 1;
		for(int i = 1;i <= 10;++i)
			if(add[now][i]) {
				in[ls][i] = mid - l + 1;add[ls][i] = 1;del[ls][i] = 0;
				in[rs][i] = r - mid;add[rs][i] = 1;del[ls][i] = 0;
				add[now][i] = 0;
			} else if(del[now][i]) {
				in[ls][i] = 0;del[ls][i] = 1;add[ls][i] = 0;
				in[rs][i] = 0;del[rs][i] = 1;add[rs][i] = 0;
				del[now][i] = 0;
			}
		for(int i = 1;i <= 10;++i) {
			if(in[ls][i] < mid - l + 1 && mn[ls] > i)
				mn[ls] = i , cnt[ls] = mid - l + 1 - in[ls][i];
			if(in[rs][i] < r - mid && mn[rs] > i)
				mn[rs] = i , cnt[rs] = r - mid - in[rs][i];
		}
	}
	void pushup(int now , int l , int r) {
		int mid = l + r >> 1 , ls = now << 1 , rs = now << 1 | 1;
		mn[now] = 11;cnt[now] = r - l + 1;
		for(int i = 1;i <= 10;++i)in[now][i] = in[ls][i] + in[rs][i];
		for(int i = 1;i <= 10;++i)
			if(in[now][i] < r - l + 1)
				{mn[now] = i;cnt[now] = r - l + 1 - in[now][i];break;}
		sum[now] = sum[ls] + sum[rs];
	}
	void update(int now , int l , int r , int x , int y , int val , int type) {
//		printf("now = %d l = %d r = %d\n",now,l,r);
		if(l != r)pushdown(now , l , r);
		if(x <= l && r <= y) {
			in[now][val] = r - l + 1;
			if(type == 1)add[now][val] = 1 , del[now][val] = 0;
			else del[now][val] = 1 , in[now][val] = 0;
			mn[now] == 11;
			for(int i = 1;i <= 10;++i)
				if(in[now][i] < r - l + 1)
					{mn[now] = i;cnt[now] = r - l + 1 - in[now][i];}
			return;
		}
		int mid = l + r >> 1;
		if(x <= mid)update(now << 1 , l , mid , x , y , val , type);
		if(mid < y)update(now << 1 | 1 , mid + 1 , r , x , y , val , type);
		pushup(now , l , r);
	}
	void modify(int now , int l , int r , int x , int y , ull val) {
		if(l != r)pushdown(now , l , r);
		if(x <= l && r <= y) {
			tag[now] += val;
			sum[now] += cnt[now] * val;
			return;
		}
		int mid = l + r >> 1;
		if(x <= mid)modify(now << 1 , l , mid , x , y , val);
		if(mid < y)modify(now << 1 | 1 , mid + 1 , r , x , y , val);
		pushup(now , l , r);
	}
	ull query(int now , int l , int r , int x , int y) {
		if(l != r)pushdown(now , l , r);
		if(x <= l && r <= y)return sum[now];
		int mid = l + r >> 1;
		ull res = 0;
		if(x <= mid)res = query(now << 1 , l , mid , x , y);
		if(mid < y)res += query(now << 1 | 1 , mid + 1 , r , x , y);
		pushup(now , l , r);
		return res;
	}
}T0;
int main() {
//	freopen("paint.in","r",stdin);
//	freopen("paint.out","w",stdout);
	scanf("%d%d",&n,&m);
	Q = m;
	for(int i = 1;i <= Q;++i) {
		scanf("%d%d%d",&q[i].opt,&q[i].l,&q[i].r);
		if(q[i].opt == 1 || q[i].opt == 2)scanf("%d",&q[i].x);
		else if(q[i].opt == 3)scanf("%llu",&q[i].v);
	}
	if(n <= 1000 && m <= 1000) {
		for(int i = 1;i <= n;++i)T[i].build(1 , 1 , m);
		for(int j = 1;j <= Q;++j) {
			int opt = q[j].opt;
			int l = q[j].l , r = q[j].r , x = q[j].x;
			ull v = q[j].v;
			if(opt == 1 || opt == 2) {
				for(int i = l;i <= r;++i)
					T[i].update(1 , 1 , m , x , (opt == 1) ? 1 : 0);
			}
			if(opt == 3) {
				int mn = m + 1;
				for(int i = l;i <= r;++i)
					if(T[i].id[1] < mn)mn = T[i].id[1];
				for(int i = l;i <= r;++i)
					if(T[i].id[1] == mn)val[i] += v;
			}
			if(opt == 4) {
				ull ans = 0;
				for(int i = l;i <= r;++i)ans += val[i];
				printf("%llu\n",ans);
			}
		}
		return 0;
	}
	bool task2 = 1;
	for(int i = 1;i <= Q;++i)
		if(q[i].x > 10) {task2 = 0;break;}
	if(task2) {
		T0.build(1 , 1 , n);
		for(int i = 1;i <= Q;++i) {
			int opt = q[i].opt;
			int l = q[i].l , r = q[i].r , x = q[i].x;
			ull v = q[i].v;
			if(opt == 1 || opt == 2)T0.update(1 , 1 , n , l , r , x , (opt == 1) ? 1 : 0);
			else if(opt == 3)T0.modify(1 , 1 , n , l , r , v);
				else printf("%llu\n",T0.query(1 , 1 , n , l , r));
		}
		return 0;
	}
}