#include<bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

const int N = 2e5 + 5;
int n, m;

struct Segment {
	struct Tree {
		ll f;
		int mn;
	} t[N << 2];
	int w[N];
	int val[N];
	int cnt[N];
	#define ls (p << 1)
	#define rs ((p << 1) | 1)
	ll up(int p, int l, int r, int x) {
		if (l == r) return t[p].mn < x ? val[l] : 0;
		int mid = (l + r) / 2;
		if (t[rs].mn >= x) return up(ls, l, mid, x);
		else return up(rs, mid + 1, r, x) + t[p].f - t[rs].f;
	} 
	void build(int p, int l, int r) {
		if (l == r) {
			t[p].f = t[p].mn = 1e9;
			return ;
		}
		int mid = (l + r) / 2;
		build(ls, l, mid);
		build(rs, mid + 1, r);
		t[p].mn = 1e9;
		t[p].f = 1e9;
	}
	void upd(int p, int l, int r, int x, int v) {
		if (l == r) {
			//cout << x << ' ' << w[x] << endl;
			cnt[l] += v;
			if (cnt[l] == 0) t[p].mn = 1e9, t[p].f = 1e9;
			else t[p].mn = w[l], t[p].f = val[l];
			return ;
		}
		int mid = (l + r) / 2;
		if (x <= mid) upd(ls, l, mid, x, v);
		else upd(rs, mid + 1, r, x, v);
		t[p].mn = min(t[ls].mn, t[rs].mn);
		t[p].f = t[rs].f + up(ls, l, mid, t[rs].mn);
	}
	int mn;
	ll ans;
	void query(int p, int l, int r, int L, int R) {
		if (L <= l && r <= R) {
		//	cout << l << ' ' << r << ' ' << t[p].mn << ' ' << mn << endl;			 
			ans += up(p, l, r, mn);
			mn = min(mn, t[p].mn);
			return ;
		}
		int mid = (l + r) / 2;
		if (mid < R) query(rs, mid + 1, r, L, R);
		if (L <= mid) query(ls, l, mid, L, R);
	}
	ll query(int l, int r, int v) {
		mn = v;
		ans = 0;
		query(1, 1, m, l, r);
		return ans;
	}
} t[2];
int mp[N], tot;
struct Upd {
	int op, l, r, w;
} q[N];
vector < pair <int, int> > ask[N], add[N];
ll ans[N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> q[i].op;
		if (q[i].op == 1) cin >> q[i].l >> q[i].r >> q[i].w, mp[++tot] = q[i].w;
		else cin >> q[i].l >> q[i].w, mp[++tot] = q[i].w;
	}
	sort(mp + 1, mp + tot + 1);
	for (int i = 1; i <= m; i++) {
		int v = lower_bound(mp + 1, mp + tot + 1, q[i].w) - mp;
		//cout << v << endl;
		t[0].w[v] = i;
		t[1].w[m - v + 1] = i;
		t[0].val[v] = mp[v];
		t[1].val[m - v + 1] = mp[v];		
		if (q[i].op == 1) add[q[i].l].push_back({v, 1}), add[q[i].r + 1].push_back({v, -1});
		else ask[q[i].l].push_back({v, i});
	}
	t[0].build(1, 1, m);
	t[1].build(1, 1, m);
	for (int i = 1; i <= n; i++) {
		for (auto qwq : add[i]) {
			int x = qwq.first, w = qwq.second;
			t[0].upd(1, 1, m, x, w);
			t[1].upd(1, 1, m, m - x + 1, w);
		}
		for (auto qwq : ask[i]) {
			int x = qwq.first, id = qwq.second;
			ans[id] = t[0].query(1, x, id) + t[1].query(1, m - x + 1, id);
		}
	}
	for (int i = 1; i <= m; i++) if (q[i].op == 2) cout << ans[i] << '\n';
	QwQ330AwA;
}

/*
按序列扫，时间轴上前缀LIS+后缀LDS  
说错了，值域上对时间的后缀严格最小值+前缀严格最小值
楼房重建。
*/