#include<bits/stdc++.h>
#define LL long long
#define eb emplace_back
#define IN inline
#define UL unsigned long long
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;
}
struct heap{
	priority_queue<int, vector<int>, greater<int> > A,B;
	void Insert(int x){A.push(x);}
	void Del(int x){B.push(x);}
	int Top() {
		while (!A.empty() && !B.empty() && A.top() == B.top()) A.pop(), B.pop();
		if (A.empty()) return (int)1e9;
		return A.top();
	}
}f[N << 2]; 
struct nd{int z, c;}mn[N << 2];
UL sum[N << 2], tag[2][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) {
	int mid = l + r >> 1;
	if (tag[0][k] != 0) {
		int z = f[k].Top();
		if (z == mn[k].z) tag[1][k] += tag[0][k];
		else {
			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) {
		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].Top();
	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;
	pushdown(k, l, r);
	if (L <= l && r <= R) {
		if (fl == 1) f[k].Insert(x); else f[k].Del(x);
		pushup(k, l, r, 0);
		return;
	}
	int mid = l + r >> 1; 
	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) {
		if (mz == z) getplus(l, r, k, v, 1);
		else if (mn[k].z == z) getplus(l, r, k, v, 0);
		return;
	} 
	int mid = l + r >> 1, val = f[k].Top(); pushdown(k, l, r);
	if (L <= mid) addmn(l, mid, k << 1, L, R, z, v, min(mz, val));
	if (R > mid) addmn(mid + 1, r, k << 1 | 1, L, R, z, v, min(mz, val));
	pushup(k, l, r, 1);
}
int getmn(int l, int r, int k, int L, int R) {
	if (L <= l && r <= R) return min(f[k].Top(), mn[k].z);
	int mid = l + r >> 1, res = f[k].Top(); 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;
	friend bool operator < (odt x, odt y){return x.l < y.l;}
}a[N];
set<odt> T[N];
void change(int id, int l, int r, int z) {
	auto it = T[id].upper_bound(odt{l, 0});
	if (it != T[id].begin()) it--;
	if (it->r < l) it++; 
	auto itl = it; int cnt = 0;
	while (it != T[id].end()) {
		if (it->l > r) break;
		a[++cnt] = *it, update(1, n, 1, it->l, it->r, id, -1);
		it++;
	}
	if (cnt) {
		T[id].erase(itl, it);
		if (a[1].l < l)
			update(1, n, 1, a[1].l, l - 1, id, 1), T[id].insert(odt{a[1].l, l - 1});
		if (a[cnt].r > r)
			update(1, n, 1, r + 1, a[cnt].r, id, 1), T[id].insert(odt{r + 1, a[cnt].r});
	}
	if (z == 0) T[id].insert(odt{l, r}), update(1, n, 1, l, r, id, 1);
}
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});
	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);
			addmn(1, n, 1, l, r, z, x, (int)1e9);
		}
		if (opt == 4) {
			UL ans = query(1, n, 1, l, r);
			printf("%llu\n", ans); 
		}
	}
}