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

cs int oo = 1e9 + 7; 

cs int N = 5e5 + 5; 

int n, q; 

int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    cin >> n >> q; 
    vector <int> a(n + 1, 0), b(n + 1, oo);
    for(int z = 0; z < q; z++) {
        int op, l, r;
        scanf("%d%d%d", &op, &l, &r);
        for(int i = l; i <= r; i++) {
            if(op == 1) {
                ++ a[i];
            }
            if(op == 2) {
                -- a[i];
                if(a[i] < b[i]) b[i] = oo;
            }
            if(op == 3) {
                if(b[i] == oo) b[i] = a[i];
            }
            if(op == 4) {
                if(b[i] < a[i]) a[i] = b[i];
            }
            if(op == 5) {
                cout << a[i] + 500000 << '\n';
            }
        }
    }
    return 0; 
}