#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define buff ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;

class ST
{
public:

	ST(int x = 1000010)
	{
		n = x;
		sza = 0;
		int np = getsize(n);
		sg.assign(np, 0);
		stm.assign(np, 0);
	}

	ST(vector<ll>& aa, int x = -1)
	{
		a = aa;
		if(x == -1)
			n = a.size() - 1;
		else
			n = x;
		sza = a.size();
		int np = getsize(n);
		sg.assign(np, 0);
		stm.assign(np, 0);
		build(1, n);
	}

	void update(int p, ll x)
	{
		_update(p, p, x, 1, n);
	}

	void update(int l, int r, ll x)
	{
		_update(l, r, x, 1, n);
	}

	ll query(int p)
	{
		return _query(p, p, 1, n);
	}

	ll query(int l, int r)
	{
		if(l > r)return 0;
		return _query(l, r, 1, n);
	}

protected:

	void _update(int L, int R, ll x, int l, int r, int p = 1)
	{
		stm[p] += x * (R - L + 1);
		if(L <= l && r <= R)
		{
			sg[p] += x;
			return;
		}
		int mid = (l + r) >> 1;
		if(R <= mid)
			_update(L, R, x, l, mid, p << 1);
		else if(L > mid)
			_update(L, R, x, mid + 1, r, p << 1 | 1);
		else
		{
			_update(L, mid, x, l, mid, p << 1);
			_update(mid + 1, R, x, mid + 1, r, p << 1 | 1);
		}
	}

	ll _query(int L, int R, int l, int r, int p = 1)
	{
		if(L <= l && r <= R)
			return stm[p];
		ll ret = sg[p] * (R - L + 1);
		int mid = (l + r) >> 1;
		if(R <= mid)
			ret += _query(L, R, l, mid, p << 1);
		else if(L > mid)
			ret += _query(L, R, mid + 1, r, p << 1 | 1);
		else
		{
			ret += _query(L, mid, l, mid, p << 1);
			ret += _query(mid + 1, R, mid + 1, r, p << 1 | 1);
		}
		return ret;
	}

private:

	int n;

	int sza;
	vector<ll>a0;
	vector<ll>& a = a0;

	vector<ll>stm, sg;

	unsigned int getsize(unsigned int x)
	{
		unsigned int xx = x;
		xx |= xx >> 1;
		xx |= xx >> 2;
		xx |= xx >> 4;
		xx |= xx >> 8;
		xx |= xx >> 16;
		if(x == ((xx + 1) >> 1))
			return (xx + 1);
		else
			return ((xx + 1) << 1);
	}

	void build(int l, int r, int p = 1)
	{
		if(l == r)
		{
			if(l < sza)
				stm[p] = a[l];
			else
				stm[p] = 0;
			return;
		}
		int mid = (l + r) >> 1;
		build(l, mid, p << 1);
		build(mid + 1, r, p << 1 | 1);
		stm[p] = stm[p << 1] + stm[p << 1 | 1];
	}

};


int main()
{
	buff;
	int n, q;
	while(cin >> n >> q)
	{
		ST st(n + 10);
		ST st2(n + 10);
		while(q--)
		{
			int op, l, r;
			cin >> op >> l >> r;
			if(op == 1)
			{
				st.update(l, 1);
				st.update(r+1, -1);
				//st2.update(l, -1);
				//st2.update(r+1, 1);
			}
			else if(op == 2)
			{
				cout << st.query(1, r)/* - max(st2.query(1, r),0LL),0LL)*/ << '\n';
			}
		}
	}
	return 0;
}