#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 1e9 + 7;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 111;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN], inv[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
inline void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

int n, m;

struct myheap{
	priority_queue< int, vi, greater<int> > pq0, pq1;
	myheap(){}
	inline void ins(int x){ pq0.push(x); }
	inline void del(int x){ pq1.push(x); }
	inline int top(){
		while(!pq0.empty() && !pq1.empty() && pq0.top() == pq1.top()) pq0.pop(), pq1.pop();
		return pq0.empty() ? inf : pq0.top();
	}
	void trav(){
		vi tmp;
		cout << "{";
		while(!pq0.empty()) tmp.push_back(pq0.top()), cout << pq0.top() << ", ", pq0.pop();
		for(auto x : tmp) pq0.push(x);
		tmp.clear();
		cout << "} - {";
		while(!pq1.empty()) tmp.push_back(pq1.top()), cout << pq1.top() << ", ", pq1.pop();
		for(auto x : tmp) pq1.push(x);
		tmp.clear();
		cout << "}";
	}
};

myheap has[1200120];
int mn[1200120], mncnt[1200120]; ull sum[1200120], mntag[1200120], alltag[1200120];

void pushup(int l, int r, int u){
	mn[u] = min({has[u].top(), mn[u+u], mn[u+u+1]});
	if(mn[u] == has[u].top()) mncnt[u] = r - l + 1;
	else mncnt[u] = (mn[u+u] == mn[u] ? mncnt[u+u] : 0) + (mn[u+u+1] == mn[u] ? mncnt[u+u+1] : 0);
	sum[u] = sum[u+u] + sum[u+u+1];
}

void pushalltag(int l, int r, int u, ull v){ sum[u] += v * (r-l+1), alltag[u] += v; }
void pushmntag(int l, int r, int u, ull v){
	//cout << "pushtag " << l << " " << r << " " << u << " " << v << endl;
	(mn[u] == has[u].top()) ? pushalltag(l, r, u, v) : (sum[u] += v * mncnt[u], mntag[u] += v, void());
}
void pushdown(int l, int r, int u){
	int mid = (l+r) >> 1;
	if(mn[u+u] == mn[u]) pushmntag(l, mid, u+u, mntag[u]);
	if(mn[u+u+1] == mn[u]) pushmntag(mid+1, r, u+u+1, mntag[u]);
	pushalltag(l, mid, u+u, alltag[u]), pushalltag(mid+1, r, u+u+1, alltag[u]);
	mntag[u] = alltag[u] = 0;
}

void build(int l, int r, int k){
	if(l == r) return mn[k] = inf, mncnt[k] = 1, void();
	int mid = (l+r) >> 1;
	build(l, mid, k+k), build(mid+1, r, k+k+1);
	pushup(l, r, k);
}

void col(int tp, int tl, int tr, int x, int l, int r, int k){
	//cout << "col " << tp << " " << tl << " " << tr << " " << x << " " << l << " " << r << " " << k << endl;
	if(tl > r || l > tr) return ;
	pushdown(l, r, k);
	if(tl <= l && r <= tr) return (tp ? has[k].del(x) : has[k].ins(x)), pushup(l, r, k);
	int mid = (l+r) >> 1;
	col(tp, tl, tr, x, l, mid, k+k), col(tp, tl, tr, x, mid+1, r, k+k+1);
	pushup(l, r, k);
}

int qrymn(int tl, int tr, int l, int r, int k){
	if(tl > r || l > tr) return inf;
	if(tl <= l && r <= tr) return mn[k];
	//pushdown(l, r, k); // 没必要吧
	int mid = (l+r) >> 1;
	return min({qrymn(tl, tr, l, mid, k+k), qrymn(tl, tr, mid+1, r, k+k+1), has[k].top()});
}

void updall(int tl, int tr, ull v, int l, int r, int k){
	if(tl > r || l > tr) return ;
	if(tl <= l && r <= tr) return pushalltag(l, r, k, v);
	pushdown(l, r, k);
	int mid = (l+r) >> 1;
	updall(tl, tr, v, l, mid, k+k), updall(tl, tr, v, mid+1, r, k+k+1);
	pushup(l, r, k);
}
void updmn(int tl, int tr, int curmn, ull v, int l, int r, int k){
	//cout << "updmn " << tl << " " << tr << " " << curmn << " " << v << endl;
	if(tl > r || l > tr || mn[k] > curmn) return ;
	if(tl <= l && r <= tr) return pushmntag(l, r, k, v);
	pushdown(l, r, k);
	int mid = (l+r) >> 1;
	if(has[k].top() == curmn){
		updall(tl, tr, v, l, r, k);
	} else {
		updmn(tl, tr, curmn, v, l, mid, k+k), updmn(tl, tr, curmn, v, mid+1, r, k+k+1);
	}
	pushup(l, r, k);
}

ull qrysum(int tl, int tr, int l, int r, int k){
	if(tl > r || l > tr) return 0;
	if(tl <= l && r <= tr) return sum[k];
	pushdown(l, r, k);
	int mid = (l+r) >> 1;
	return qrysum(tl, tr, l, mid, k+k) + qrysum(tl, tr, mid+1, r, k+k+1);
}

void trav(int l, int r, int k){
	//cout << " | " << l << " " << r << " " << k << ": " << mn[k] << " " << mncnt[k] << "  " << sum[k] << " " << mntag[k] << " " << alltag[k] << ": ";
	has[k].trav();
	//cout << "\n";
	if(l < r){
		int mid = (l+r) >> 1;
		trav(l, mid, k+k), trav(mid+1, r, k+k+1);
	}
}

set<pii> st[300300];

int main(){
	//freopen("ex_paint2.in", "r", stdin);
	//freopen("paint.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;

	build(0, n-1, 1);
	rep(i, m+1) col(0, 0, n-1, i, 0, n-1, 1), st[i].insert(make_pair(0, n-1));

	while(m--){
		//cout << "------------------" << m << "-------------------" << endl;
		int tp;
		cin >> tp;
		if(tp == 2){
			int l, r, x;
			cin >> l >> r >> x;
			--l, --r, --x;
			auto it = st[x].lower_bound(make_pair(l, -1));
			if(it != st[x].begin() && prev(it)->second >= l) --it, l = it->first;
			while(it != st[x].end() && it->first <= r){
				chmax(r, it->second);
				col(1, it->first, it->second, x, 0, n-1, 1);
				it = st[x].erase(it);
			}
			st[x].insert(make_pair(l, r));
			col(0, l, r, x, 0, n-1, 1);
		} else if(tp == 1){
			int l, r, x;
			cin >> l >> r >> x;
			--l, --r, --x;
			auto it = st[x].lower_bound(make_pair(l, -1));
			if(it != st[x].begin() && prev(it)->second >= l) --it;
			vector<pii> tmp;
			while(it != st[x].end() && it->first <= r){
				col(1, it->first, it->second, x, 0, n-1, 1);
				//cout << it->first << " " << it->second << "  " << l << " " << r << endl;
				if(it->first < l) tmp.push_back(make_pair(it->first, l-1));
				if(it->second > r) tmp.push_back(make_pair(r+1, it->second));
				it = st[x].erase(it);
			}
			for(auto p : tmp) col(0, p.first, p.second, x, 0, n-1, 1), st[x].insert(p);
		} else if(tp == 3){
			int l, r; ull v;
			cin >> l >> r >> v;
			--l, --r;
			int curmn = qrymn(l, r, 0, n-1, 1);
			//cout << " " << curmn << endl;
			updmn(l, r, curmn, v, 0, n-1, 1);
		} else {
			int l, r;
			cin >> l >> r;
			--l, --r;
			cout << qrysum(l, r, 0, n-1, 1) << "\n";
		}
		//trav(0, n-1, 1);
		//cout << "fin." << endl;
	}

	return 0;
}