#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, M = N;
int n, q, a[N], c[3][N];
mt19937 Rnd(1);
struct FHQ
{
    int tot, lc[M], rc[M], siz[M], vl[M], rd[M], rt;
    void pushup(int p)
    {
        siz[p] = siz[lc[p]] + siz[rc[p]] + 1;
    }
    void split(int p, int v, int &l, int &r)
    {
        if (!p)
            return l = r = 0, void();
        if (vl[p] <= v)
            l = p, split(rc[p], v, rc[p], r);
        else
            r = p, split(lc[p], v, l, lc[p]);
        pushup(p);
    }
    int merge(int p, int q)
    {
        if (!p || !q)
            return p + q;
        if (rd[p] < rd[q])
        {
            rc[p] = merge(rc[p], q);
            pushup(p);
            return p;
        }
        else
        {
            lc[q] = merge(p, lc[q]);
            pushup(q);
            return q;
        }
    }
    int newn(int x)
    {
        tot++;
        lc[tot] = rc[tot] = 0;
        siz[tot] = 1;
        vl[tot] = x;
        rd[tot] = Rnd();
        return tot;
    }
    void irt(int x)
    {
        int p, q;
        split(rt, x, p, q);
        rt = merge(merge(p, newn(x)), q);
    }
    void dlt(int x)
    {
        int p, q, p1, q1;
        split(rt, x, p, q);
        split(p, x - 1, p1, q1);
        p = merge(lc[q1], rc[q1]);
        rt = merge(merge(p1, p), q);
    }
    int grk(int x)
    {
        int p, q, res;
        split(rt, x, p, q);
        res = siz[p];
        rt = merge(p, q);
        return res;
    }
    int kth(int p, int x)
    {
        int lf = siz[lc[p]] + 1;
        if (x == lf)
            return vl[p];
        if (x < lf)
            return kth(lc[p], x);
        else
            return kth(rc[p], x - lf);
    }
    int ask(int x, int y)
    {
        if (!rt)
            return 0;
        int p, q, p1, q1;
        split(rt, y, p, q);
        split(p, x - 1, p1, q1);
        int res = siz[q1];
        rt = merge(merge(p1, q1), q);
        return res;
    }
} ll, rr;
int main()
{
    while (scanf("%d%d", &n, &q) != EOF)
    {
        ll.tot = ll.rt = 0;
        rr.tot = rr.rt = 0;
        int all = 0;
        while (q--)
        {
            int op, x, y, res = 0;
            scanf("%d%d%d", &op, &x, &y);
            if (op == 1)
            {
                if (y - x <= 2)
                    c[y - x][x]++;
                else
                    ll.irt(y), rr.irt(x), all++;
            }
            else
            {
                res = all;
                for (int i = y - x; i <= 2; i++)
                {
                    for (int j = y - i; j <= x; j++)
                        res += c[i][j];
                }
                res -= ll.ask(-100, x - 1);
                res -= rr.ask(y + 1, n + 100);
                printf("%d\n", res);
            }
        }
        for (int i : {0, 1, 2})
            fill(c[i], c[i] + n + 1, 0);
    }
    return 0;
}