#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define ld long double
#define int long long
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ;
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e5 + 10, sq = 4e5 , lg = 19,  mod = 1e9 + 7 , inf = 1e9+10 ;
int A[maxn] , val[maxn] ;

struct nd{
    int l = 0 , r = 0  , j1 =0 , j2 = 0 , sm =0 ;
    vector <pii> vec ;
    vector <int> sf ; 
    void bui(int R){
        vec.clear() ;
        sf.clear() ;
        int ls = 0 , sum =0 , mx = 0 ; 
        j1 = j2 =0 ; 
        per(i , R , l){
            sum += A[i] ;
            int ted = max(sum - mx , 0ll) ;
            j1 += ted ;
            j2 += ted * val[i] ;
            mx = max(mx , sum) ;
            if(sz(vec)==0 || vec.back().F < sum){
                if(sz(vec))sf.pb(val[i] * (sum-vec.back().F));
                else sf.pb(val[i]*sum);
                vec.pb({sum , val[i]}) ;
            }
        }
        per(i , sz(sf)-2 , 0){
            sf[i] += sf[i+1] ;
        }
    }
    void updsm(int mx , int bl){
        int x = lower_bound(all(vec) , (pii){mx-bl+1 , 0})-vec.begin() ;
        sm =0 ;
        if(x==sz(vec)){
            return; 
        }
        if(x!=sz(vec)-1)sm += sf[x+1] ;
        sm += (vec[x].F-mx)*vec[x].S ;
    }
    int que(int &a){
        if(a==0)return 0 ;
        if(a >= j1){
            a-=j1;
            return j2 ;
        }
        int sm = 0;
        per(i , sz(vec)-1 , 0){
            int t = min(a,max(0ll,vec[i].F-(i==0 ? 0 : vec[i-1].F))) ;
            sm += t*vec[i].S ; 
            a-=t ;
        }        
        return sm ; 
    }
};
nd s[maxn] ;

int ans[maxn] ;
vector <pair<int,pii> > u[maxn] , qu[maxn] ;
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    int n , q ;
    cin >> n >> q; 
    int cnt= 1 ;
    rep(i , 1, q){
        int t , l , r , x , y ;
        cin >> t ;
        if(t == 1){
            cin >> l >> r >> x >> y ;
            u[l].pb({i , {x,y}}) ;
            u[r+1].pb({i , {0 ,0}}) ;
        }
        if(t == 2){
            int l , r , x ;
            cin >> l >> r >> x ;
            u[l].pb({i , {-x , 0}}) ;
            u[r+1].pb({i , {0, 0}}) ;
        }
        if(t==3){
            int x , a ,b ;
            cin >> x >> a >> b ;
            qu[x].pb({i,{b,cnt}});
            qu[x].pb({i , {a-1,cnt+1}});
            cnt+=2 ;
        }
    }
    rep(i , 1 , q/sq)s[i].l = i*sq; 
    rep(i , 1, n){
        for(auto x : u[i]){
            int t= x.F , a = x.S.F , b = x.S.S ;
            A[t] = a ;
            val[t] = b; 
            s[t/sq].bui(min(q , (t/sq+1)*sq-1)) ;
        }
        for(auto x : qu[i]){
            int t= x.F , a = x.S.F , id = x.S.S ;
            s[t/sq].bui(t); 
            int mx =0 , jm = 0 ; 
            rep(j , 0, t/sq){
                s[j].updsm(mx,jm);
                if(sz(s[j].vec))mx=max(mx , jm + s[j].vec.back().F); 
                jm += s[j].sm ; 
            }
            int f =0 ;
            rep(j , 0 , t/sq){
                f += s[j].que(a) ;
            }
            ans[id] = f ; 
            s[t/sq].bui(min(q , t/sq+sq-1)) ;
        }
    }
    for(int i = 1 ; i < cnt ; i+=2){
        cout << ans[i]-ans[i+1] << "\n" ;
    }
}
/*
*/