# https://github.com/shakayami/ACL-for-python/wiki/lazysegtree

class lazy_segtree():

    '''
        T = lazy_segtree(V,OP,E,MAPPING,COMPOSITION,ID)
        
            V:初期リスト
            OP:要素同士の作用（G*G->G）
            E:OPにおける単位元  ※OP(data, E) = data
            MAPPING:要素にapplyさせる写像（F*G->G）
            COMPOSITION:写像の合成（F*F->F）
            ID:恒等写像  ※mapping(data, ID) = data
            
            F:写像fの集合
            G:X=(x[l],...,x[r-1])の集合
            
        例) x -> min(a,x) と x[l]+...+x[r-1] 
        
            op,e:要素同士を足すので op=add,e=0
            map:Fa(x) = min(a,x) とするので map=min
            comp:Fa・Fb = Fmin(a,b) より comp=min
            id:F_{INF}(x) = x より id=INF
            
        T.set(i,x):i番目の要素をxに変更
        T.get(i):i番目の要素を取得
        T.query(l,r):[l,r)に対するクエリの結果を取得
        T.apply(l,r,f):[l,r)にfを作用
        T.max_right(l,f):l<=iでf=Trueとなる最大のiを取得
        T.min_left(r,f):i<=rでf=Trueとなる最小のiを取得
        
        ※ 各要素はタプルで持つとTLEするので (a,b) -> (a<<32)+b など工夫
    '''

    def update(self,k):self.d[k]=self.op(self.d[2*k],self.d[2*k+1])
    def all_apply(self,k,f):
        self.d[k]=self.mapping(f,self.d[k])
        if (k<self.size):self.lz[k]=self.composition(f,self.lz[k])
    def push(self,k):
        self.all_apply(2*k,self.lz[k])
        self.all_apply(2*k+1,self.lz[k])
        self.lz[k]=self.identity
    def __init__(self,V,OP,E,MAPPING,COMPOSITION,ID):
        self.n=len(V)
        self.log=(self.n-1).bit_length()
        self.size=1<<self.log
        self.d=[E for i in range(2*self.size)]
        self.lz=[ID for i in range(self.size)]
        self.e=E
        self.op=OP
        self.mapping=MAPPING
        self.composition=COMPOSITION
        self.identity=ID
        for i in range(self.n):self.d[self.size+i]=V[i]
        for i in range(self.size-1,0,-1):self.update(i)
    def set(self,p,x):
        assert 0<=p and p<self.n
        p+=self.size
        for i in range(self.log,0,-1):self.push(p>>i)
        self.d[p]=x
        for i in range(1,self.log+1):self.update(p>>i)
    def get(self,p):
        assert 0<=p and p<self.n
        p+=self.size
        for i in range(self.log,0,-1):self.push(p>>i)
        return self.d[p]
    def prod(self,l,r):
        assert 0<=l and l<=r and r<=self.n
        if l==r:return self.e
        l+=self.size
        r+=self.size
        for i in range(self.log,0,-1):
            if (((l>>i)<<i)!=l):self.push(l>>i)
            if (((r>>i)<<i)!=r):self.push(r>>i)
        sml,smr=self.e,self.e
        while(l<r):
            if l&1:
                sml=self.op(sml,self.d[l])
                l+=1
            if r&1:
                r-=1
                smr=self.op(self.d[r],smr)
            l>>=1
            r>>=1
        return self.op(sml,smr)
    def all_prod(self):return self.d[1]
    def apply_point(self,p,f):
        assert 0<=p and p<self.n
        p+=self.size
        for i in range(self.log,0,-1):self.push(p>>i)
        self.d[p]=self.mapping(f,self.d[p])
        for i in range(1,self.log+1):self.update(p>>i)
    def apply(self,l,r,f):
        assert 0<=l and l<=r and r<=self.n
        if l==r:return
        l+=self.size
        r+=self.size
        for i in range(self.log,0,-1):
            if (((l>>i)<<i)!=l):self.push(l>>i)
            if (((r>>i)<<i)!=r):self.push((r-1)>>i)
        l2,r2=l,r
        while(l<r):
            if (l&1):
                self.all_apply(l,f)
                l+=1
            if (r&1):
                r-=1
                self.all_apply(r,f)
            l>>=1
            r>>=1
        l,r=l2,r2
        for i in range(1,self.log+1):
            if (((l>>i)<<i)!=l):self.update(l>>i)
            if (((r>>i)<<i)!=r):self.update((r-1)>>i)
    def max_right(self,l,g):
        assert 0<=l and l<=self.n
        assert g(self.e)
        if l==self.n:return self.n
        l+=self.size
        for i in range(self.log,0,-1):self.push(l>>i)
        sm=self.e
        while(1):
            while(l%2==0):l>>=1
            if not(g(self.op(sm,self.d[l]))):
                while(l<self.size):
                    self.push(l)
                    l=(2*l)
                    if (g(self.op(sm,self.d[l]))):
                        sm=self.op(sm,self.d[l])
                        l+=1
                return l-self.size
            sm=self.op(sm,self.d[l])
            l+=1
            if (l&-l)==l:break
        return self.n
    def min_left(self,r,g):
        assert (0<=r and r<=self.n)
        assert g(self.e)
        if r==0:return 0
        r+=self.size
        for i in range(self.log,0,-1):self.push((r-1)>>i)
        sm=self.e
        while(1):
            r-=1
            while(r>1 and (r%2)):r>>=1
            if not(g(self.op(self.d[r],sm))):
                while(r<self.size):
                    self.push(r)
                    r=(2*r+1)
                    if g(self.op(self.d[r],sm)):
                        sm=self.op(self.d[r],sm)
                        r-=1
                return r+1-self.size
            sm=self.op(self.d[r],sm)
            if (r&-r)==r:break
        return 0
    
def OP(x, y):
    xv, xz = x
    yv, yz = y
    if xv==yv:
        return (xv, xz+yz)
    else:
        return min(x, y)

INF = 10**9
# val, zero
E = (INF, 0)

def mapping(f, s):
    if f==ID:
        return s
    sv, sz = s
    return (sv+f, sz)

# gが先、fが後
def composition(f, g):
    if f==ID:
        return g
    return f+g

ID = 0

# 区間加算、0(最小値)の個数

import sys
input = sys.stdin.readline
N = int(input())
Q = int(input())
query = [list(map(int, input().split())) for _ in range(Q)]
ST = lazy_segtree([(0, 1) for _ in range(N)], OP, E, mapping, composition, ID)
for q in query:
    t = q[0]
    if t==1:
        l, r = q[1:]
        l-=1
        r-=1
        ST.apply(l, r, 1)
    elif t==2:
        i = q[1]
        i-=1
        _, l, r = query[i]
        l-=1
        r-=1
        ST.apply(l, r, -1)
    else:
        _, ans = ST.all_prod()
        print(ans)