#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;

cs int oo = 1e9 + 7; 

cs int N = 1000 + 5; 

int n, q; 

int fix(int x) {
    if(x >= oo - 5) return oo; 
    return x; 
}

struct func {
    int v1, p, v2, vi; 
    func (int v1 = 0, int p = -1, int v2 = -1, int vi = oo) 
        : v1(v1), p(p), v2(v2), vi(vi) {}
    int operator () (int x) {
        if(x == oo) return vi;
        if(x <= p) return v1; 
        return fix(v2 + x - p); 
    }
    void operator += (cs int &x) {
        v1 += x; 
        v2 += x; 
        vi += x; 
        if(v1 < 0) {
            v1 = oo; 
        }
        if(v2 < -1) {
            p -= v2 + 1; 
            v2 = -1;
        }
        if(vi < 0) {
            vi = oo; 
        }
        v1 = fix(v1); 
        v2 = fix(v2); 
        vi = fix(vi);
        p = fix(p);
    }
    void trans() {
        if(v1 == oo) v1 = 0;
        if(vi == oo) vi = 0; 
    }
};

func operator + (cs func &a, cs func &b) {
    if(a.p == oo && b.p == oo) 
        return func(fix(a.v1 + b.v1), oo, 0, fix(a.vi + b.vi)); 
    if(a.p == oo) 
        return func(fix(a.v1 + b.v1), b.p, fix(a.v1 + b.v2), fix(a.vi + b.vi));
    if(b.p == oo)
        return func(fix(a.v1 + b.v1), a.p, fix(a.v2 + b.v1), fix(a.vi + b.vi));
    // cout << a.p << ' ' << a.v1 << ' ' << a.v2 << ' ' << a.vi << endl;
    // cout << b.p << ' ' << b.v1 << ' ' << b.v2 << ' ' << b.vi << endl;
    assert(0);
}

struct skip {
    func a, c; 
    int d; 
    skip (func a = func(0, oo, 0, 0), func c = func(0, -1, -1, oo), int d = 0) : a(a), c(c), d(d) {}
};

func F(func a, func b) {
    func c; 
    if(a.p == oo) {
        c = func (a.v1, oo, 0, a(b.vi));
        assert(c(oo) == a(b(oo)));
        return c; 
    }
    if(b.p == oo) {
        c = func (a(b.v1), oo, 0, a(b.vi)); 
        assert(c(oo) == a(b(oo)));
        return c;
    }
    // a(b(d)) 
    c.vi = a(b.vi);

    // [0, b.p] -> c = a(b.v1) 
    c.p = b.p; 
    c.v1 = a(b.v1);
    // cout << "Fdsafsfasdfas " << b.v1 << ' ' << a(b.v1) << endl;
    // [b.v2 + 1, a.p] -> c = a.v1 
    if(a.p > b.v2) {
        // b.p + 1 -> b.v2 + 1 
        c.p += a.p - b.v2; 
        c.v1 = a.v1; 
    }
    c.v2 = a(b(c.p + 1)) - 1;


    for(int i = 0; i <= 10; i++) {
        // if(c(i) != a(b(i))) {
            // cout << i << ' ' << c(i) << ' ' << a(b(i)) << endl;
            // cerr << a.v1 << ' ' << a.p << ' ' << a.v2 << ' ' << a.vi << endl;
            // cerr << b.v1 << ' ' << b.p << ' ' << b.v2 << ' ' << b.vi << endl;
            // cerr << c.v1 << ' ' << c.p << ' ' << c.v2 << ' ' << c.vi << endl;
            assert(c(i) == a(b(i)));
        // } 
    }
    assert(c(oo) == a(b(oo)));

    return c; 
}

func flat (func x) {
    if(x.v1 == oo) x.v1 = 0; 
    if(x.vi == oo) x.vi = 0; 
    return x; 
}
#define mid ((l + r) >> 1)
skip t[N << 2];
bool add[N << 2]; 


void pbpb(int x, skip & c, int op) {
    if(op == 1) {
        c.c += 1;
        c.d += 1; 
    }
    if(op == 2) {
        c.c += -1; 
        c.d -= 1; 
    }
    if(op == 3) {
        c.c.trans();
    }
    if(op == 4) {
        c.a = c.a + flat(c.c); 
        c.c = F(func(0, oo, 0, oo), c.c); 
        add[x] = 1; 
    }
}

void put(int x, skip c, bool ad) {
    // d -> c (d) -> t[x] (c (d)) 
    if(ad) {
        t[x].a = t[x].a + flat(F(c.a, t[x].c));
        add[x] = 1; 
    }
    t[x].d += c.d; 
    t[x].c = F(c.c, t[x].c);
}

void down(int x) {
    put(x << 1, t[x], add[x]);
    put(x << 1 | 1, t[x], add[x]);
    add[x] = 0; 
    t[x] = skip();
}

void modify (int x, int l, int r, int L, int R, int op) {
    // cout << "modify " << x <<' ' << l << ' ' << r << ' ' << L << ' ' <<  R << endl;
    if(L <= l && r <= R) {
        pbpb(x, t[x], op);
        // cout << "modify "<< x << ' ' << l <<' ' << r << ' ' << endl;
        // cout << t[x].a.v1 << ' ' << t[x].a.p << ' ' << t[x].a.v2 << ' ' << t[x].a.vi << endl;
        // cout << t[x].c.v1 << ' ' << t[x].c.p << ' ' << t[x].c.v2 << ' ' << t[x].c.vi << endl;
        // cout << t[x].d << ' ' << t[x].a(oo) << endl;
        return;
    }
    down(x);
    if(L <= mid) modify(x << 1, l, mid, L, R, op);
    if(R > mid) modify(x << 1 | 1, mid + 1, r, L, R, op); 
}

int query(int x, int l, int r, int p) {
    if(l == r) {
        // cout << "query "<< l << endl;
        // cout << t[x].a.v1 << ' ' << t[x].a.p << ' ' << t[x].a.v2 << ' ' << t[x].a.vi << endl;
        // cout << t[x].c.v1 << ' ' << t[x].c.p << ' ' << t[x].c.v2 << ' ' << t[x].c.vi << endl;
        // cout << t[x].d << ' ' << t[x].a(oo) << endl;
        return t[x].d - t[x].a(oo); 
    }
    down(x);
    if(p <= mid) return query(x << 1, l, mid, p);
    return query(x << 1 | 1, mid + 1, r, p);
}
#undef mid 

int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    cin >> n >> q; 
    for(int z = 0; z < q; z++) {
        int op, l, r;
        scanf("%d%d%d", &op, &l, &r);
        // cout << "FFF " << op << ' ' << l << ' ' << r << endl;
        if(op <= 4) {
            modify(1, 1, n, l, r, op);
        }
        if(op == 5) {
            cout << query(1, 1, n, l) + 500000 << '\n';
        }
        // cerr << "FFFF " << op << ' ' << l << ' ' << r << endl;
        // for(int j = 1; j <= n; j++) {
        //     cerr <<
        //     query(1, 1, n, j) 
        //     << ' '; 
        // }
        // cerr << endl;
    }       
    return 0; 
}