#include<bits/stdc++.h>
#define LL long long
#define eb emplace_back
#define IN inline
using namespace std;
const int N = 3e5 + 5;
int n, m;

IN LL read() {
	LL t = 0,res = 0; char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) t |= (ch == '-');
	for (; isdigit(ch); ch = getchar()) res = (res << 3) + (res << 1) + (ch ^ 48);
	return t ? -res : res;
}
#define UL unsigned long long
struct nd{int z, c;}mn[N << 2];
UL sum[N << 2], tag[2][N << 2];
set<int> f[N << 2];
void getplus(int l, int r, int k, UL z, int fl) {
	if (fl == 0) tag[0][k] += z, sum[k] += (UL)mn[k].c * z;
	else tag[1][k] += z, sum[k] += (UL)(r - l + 1) * z;
}
void pushdown(int k, int l, int r) {
//	if (tag[0][k] != 0 || tag[1][k] != 0) 
//		printf("%d %d %llu %llu\n", l, r, tag[0][k], tag[1][k]);
	if (tag[0][k] != 0) {
		int z = *(f[k].lower_bound(0));
//		printf("%d %d %d %d\n",z,mn[k].z,l,r);
		if (z == mn[k].z) tag[1][k] += tag[0][k];
		else {
			int mid = l + r >> 1;
//			printf("%d %d %d\n", z, mn[k << 1].z, mn[k << 1 | 1].z);
			if (mn[k << 1].z == mn[k].z) getplus(l, mid, k << 1, tag[0][k], 0);
			if (mn[k << 1 | 1].z == mn[k].z) getplus(mid + 1, r, k << 1 | 1, tag[0][k], 0);
		}
		tag[0][k] = 0;
	}
	if (tag[1][k] != 0) {
		int mid = l + r >> 1;
		getplus(l, mid, k << 1, tag[1][k], 1);
		getplus(mid + 1, r, k << 1 | 1, tag[1][k], 1);
		tag[1][k] = 0;
	}
}
nd Min(nd x, nd y) {
	if (x.z < y.z) return x;
	if (x.z == y.z) return nd{x.z, x.c + y.c};
	if (x.z > y.z) return y;
}
void pushup(int k, int l, int r, int fl) {
	mn[k] = nd{(int)1e9, 0};
	if (l ^ r) mn[k] = Min(mn[k], mn[k << 1]), mn[k] = Min(mn[k], mn[k << 1 | 1]);
	int z = *(f[k].lower_bound(0));
	if (mn[k].z > z) mn[k] = nd{z, r - l + 1};
	if (fl) sum[k] = sum[k << 1] + sum[k << 1 | 1];
}
void update(int l, int r, int k, int L, int R, int x, int fl) {
	if (L > R) return;
	if (L <= l && r <= R) {
		if (fl == 1) f[k].insert(x); else f[k].erase(x);
		pushup(k, l, r, 0);
		return;
	}
	int mid = l + r >> 1; pushdown(k, l, r);
	if (L <= mid) update(l, mid, k << 1, L, R, x, fl);
	if (R > mid) update(mid + 1, r, k << 1 | 1, L, R, x, fl);
	pushup(k, l, r, 1);
}
void addmn(int l, int r, int k, int L, int R, int z, UL v, int mz) {
	if (L <= l && r <= R) {
//		printf("%d %d %d %d\n", l, r, mn[k].z, z);
		if (min(mz, mn[k].z) == z) getplus(l, r, k, v, 0);
		return;
	} 
	int mid = l + r >> 1; pushdown(k, l, r);
	if (L <= mid) addmn(l, mid, k << 1, L, R, z, v, min(mz, mn[k].z));
	if (R > mid) addmn(mid + 1, r, k << 1 | 1, L, R, z, v, min(mz, mn[k].z));
	pushup(k, l, r, 1);
}
int getmn(int l, int r, int k, int L, int R) {
	if (L <= l && r <= R) return mn[k].z;
	int mid = l + r >> 1, res = mn[k].z; pushdown(k, l, r);
	if (L <= mid) res = min(res, getmn(l, mid, k << 1, L, R));
	if (R > mid) res = min(res, getmn(mid + 1, r, k << 1 | 1, L, R));
	return res;
}
UL query(int l, int r, int k, int L, int R) {
	if (L <= l && r <= R) return sum[k];
	int mid = l + r >> 1; UL res = 0; pushdown(k, l, r);
	if (L <= mid) res = query(l, mid, k << 1, L, R);
	if (R > mid) res += query(mid + 1, r, k << 1 | 1, L, R);
	return res;
}
struct odt{
	int l, r, z;
	friend bool operator < (odt x, odt y){return x.r < y.r;}
};
set<odt> T[N];
void split(int id, int x, int fl, int z) {
	auto it = T[id].lower_bound(odt{0, x, 0});
	int cor = it->z, l = it->l, r = it->r;
//	printf("%d %d %d %d\n", x, l, r, cor);
	
	if (cor == 0) {
		update(1, n, 1, l, r, id, -1);
		if (fl == 1) update(1, n, 1, x + 1, r, id, 1);
		else update(1, n, 1, l, x - 1, id, 1);
	}
	T[id].erase(it);
	if (fl == 1) {
		if (x < r) T[id].insert(odt{x + 1, r, cor});
		T[id].insert(odt{l, x, cor});
	}
	else {	
		if (l < x) T[id].insert(odt{l, x - 1, cor});
		T[id].insert(odt{x, r, cor});
	}
}
void prf(int l, int r, int k) {
	printf("%d %d\n",l,r);
	for (auto i = f[k].begin(); i != f[k].end(); i++)
		printf("%d ", *i);
	puts("");
	if (l == r) return;
	int mid = l + r >> 1;
	prf(l, mid, k << 1), prf(mid + 1, r, k << 1 | 1);
}
void change(int id, int l, int r, int z) {
	split(id, r, 1, z), split(id, l, 0, z);
//	puts("ff");
	auto itl = T[id].lower_bound(odt{0, l, 0}), itr = T[id].lower_bound(odt{0, r, 0});
//	printf("%d %d %d %d %d %d\n",itl->l,itl->r,itl->z,itr->l,itr->r,itr->z);
	for (auto i = itl; i != itr; i++) {
		if (i == itl || i == itr) continue;
		if (i->z == 0) update(1, n, 1, i->l, i->r, id, -1);
	}
	if (z == 0) update(1, n, 1, l, r, id, 1);
	T[id].erase(itl, itr), T[id].insert(odt{l, r, z});
}
void build(int l, int r, int k) {
	mn[k] = nd{(int)1e9, r - l + 1}, f[k].insert((int)1e9);
	if (l == r) return; int mid = l + r >> 1;
	build(l, mid, k << 1), build(mid + 1, r, k << 1 | 1);
}
int main() {
	n = read(), m = read(), build(1, n, 1), mn[1] = nd{1, n};
	for (int i = 1; i <= m; i++) f[1].insert(i), T[i].insert(odt{1, n, 0});
	for (int i = 1; i <= m; i++) {
		int opt = read(), l = read(), r = read(); LL x;
		if (opt == 1) x = read(), change(x, l, r, 1);
		if (opt == 2) x = read(), change(x, l, r, 0);
		if (opt == 3) {
			x = read();
			int z = getmn(1, n, 1, l, r);
//			printf("ff %d\n", z);
			addmn(1, n, 1, l, r, z, x, (int)1e9);
		}
		if (opt == 4) {
//		puts("");
//		prf(1, n, 1);
			UL ans = query(1, n, 1, l, r);
			printf("%llu\n", ans); 
		}
	}
}