#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5;
#define F(i,l,r) for(int i=(l);i<=(r);i++)
struct node{
    int l,r,sm,sl,yc,y;
}p[N<<2];
struct msg{
    int sl,yc,sm;
};
void reset(int x,int l,int r){
    p[x].l=l,p[x].r=r;
    if(l==r)return;
    int mid=l+r>>1;
    reset(x<<1,l,mid);
    reset(x<<1|1,mid+1,r);
}
int gets(int x,int k){
    if(k>p[x].sl)return p[x].sm;
    if(p[x].l==p[x].r)return k*p[x].y;
    if(p[x<<1|1].sl>=k)return gets(x<<1|1,k);
    return gets(x<<1,k-p[x<<1|1].sl+p[x<<1|1].yc)+p[x<<1|1].sm-(p[x<<1].sm+p[x<<1|1].sm-p[x].sm);
}
msg gmsg(int x,int d){
    if(p[x].l==p[x].r)return {p[x].sl,p[x].yc};
    int mid=p[x].l+p[x].r>>1;
    if(d<=mid)return gmsg(x<<1,d);
    msg res=gmsg(x<<1|1,d);
    if(res.yc>=p[x<<1].sl)return {res.sl,p[x<<1].yc+res.yc-p[x<<1].sl};
    return {res.sl+p[x<<1].sl-res.yc,p[x<<1].yc};
}
msg ex_gmsg(int x,int d){
    if(p[x].l==p[x].r)return {p[x].sl,p[x].yc};
    int mid=p[x].l+p[x].r>>1;
    if(d<=mid)return ex_gmsg(x<<1,d);
    msg res=ex_gmsg(x<<1|1,d);
    if(res.yc>=p[x<<1].sl)return {res.sl,p[x<<1].yc+res.yc-p[x<<1].sl,res.sm};
    return {res.sl+p[x<<1].sl-res.yc,p[x<<1].yc,res.sm+p[x<<1].sm-gets(x<<1,res.yc)};
}
void upset(int x){
    if(p[x<<1|1].yc>=p[x<<1].sl){
        p[x].sl=p[x<<1|1].sl;
        p[x].yc=p[x<<1].yc+p[x<<1|1].yc-p[x<<1].sl;
        p[x].sm=p[x<<1|1].sm;
    }else{
        p[x].sl=p[x<<1|1].sl+p[x<<1].sl-p[x<<1|1].yc;
        p[x].yc=p[x<<1].yc;
        p[x].sm=p[x<<1].sm+p[x<<1|1].sm-gets(x<<1,p[x<<1|1].yc);
    }
   // cout<<p[x].l<<" "<<p[x].r<<" "<<p[x].sl<<" "<<p[x<<1].sl<<" "<<p[x<<1|1].sl<<endl;
}
void add(int x,int d,int xx,int y){
    if(p[x].l==p[x].r){
      //  cout<<xx<<endl;
        p[x].sm+=xx*y;
        p[x].sl+=xx;
        p[x].y=y;
        return;
    }
    int mid=p[x].l+p[x].r>>1;
    if(d<=mid)add(x<<1,d,xx,y);
    else add(x<<1|1,d,xx,y);
    upset(x);
}
void del(int x,int d,int k){
    if(p[x].l==p[x].r){
        p[x].yc+=k;
        return;
    }
    int mid=p[x].l+p[x].r>>1;
    if(d<=mid)del(x<<1,d,k);
    else del(x<<1|1,d,k);
    upset(x);
}
int gets(int x,int d,int k){
    if(p[x].l==p[x].r)return p[x].sm;
    int mid=p[x].l+p[x].r>>1;
    if(d<=mid)return gets(x<<1,d,k);
    msg res=gmsg(x<<1|1,d);
    if(res.sl>=k)return gets(x<<1|1,d,k);
    return gets(x<<1,k-res.sl+res.yc)-gets(x<<1,res.yc)+ex_gmsg(x<<1|1,d).sm;
}
int n,m,mk[N],rs[N];
struct nodes{
    int op,lx,x,tm,y;
    friend bool operator<(nodes a,nodes b){
        return a.op<b.op;
    }
};
vector<nodes>q[N];
signed main(){
    cin>>n>>m;
    F(i,1,m){
        int op,l,r,x,y;
        cin>>op>>l>>r>>x;
        if(op==1){
            cin>>y;
            q[l].push_back({1,1,x,i,y});
            q[r+1].push_back({1,0,x,i,y});
        }else if(op==2){
            q[l].push_back({2,1,x,i});
            q[r+1].push_back({2,-1,x,i});
        }else{
            q[l].push_back({3,1,r,i,x});
        }
    }
    reset(1,1,m);
    F(i,1,n){
        sort(q[i].begin(),q[i].end());
        for(auto c:q[i]){
            if(c.op==1){
                if(c.lx)add(1,c.tm,c.x,c.y);
                else add(1,c.tm,-c.x,c.y);
            }else if(c.op==2){
                if(c.lx)del(1,c.tm,c.x);
                else del(1,c.tm,-c.x);
            }else{
                msg t=gmsg(1,c.tm);
             //   cout<<c.tm<<" "<<t.sl<<" "<<p[1].sl<<endl;
                rs[c.tm]=gets(1,c.tm,t.sl-c.x+1)-gets(1,c.tm,t.sl-c.y);
                mk[c.tm]=1;
            }
        }
    }
    F(i,1,m)if(mk[i])cout<<rs[i]<<"\n";
}