/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18, SQ = 2;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int t, n, m, cntb, L[N], R[N], b[N], typ[N], mark[N];
vector<ll> Q[N];
vector<int> Q2[N], Q3[N];
// for response
ll ans[N], bdel[N], hbd[N], res;
vector<pll> bsuf[N], bsuff[N];


void calc(int bl) {
    vector<pll> tmp;
    
    bdel[bl] = 0;
    for(int i=L[bl]; i<=R[bl]; i++) {
        if(mark[i] == 0) continue;
        if(typ[i] == 1) tmp.pb({Q[i][2], Q[i][3]});
        else {
            ll num = Q[i][2];
            while(size(tmp) > 0 && num > 0) {
                if(tmp.back().F <= num) {
                    num -= tmp.back().F;
                    tmp.pop_back();
                } else {
                    tmp.back().F -= num; num = 0;
                }
            }
            bdel[bl] += num;
        }
    }
    bsuf[bl] = bsuff[bl] = tmp;
    for(int i=size(bsuf[bl])-1; i>=0; i--) {
        bsuf[bl][i].S *= bsuf[bl][i].F;
        if(i<size(tmp)-1)bsuf[bl][i].S += bsuf[bl][i+1].S;
        if(i<size(tmp)-1)bsuf[bl][i].F += bsuf[bl][i+1].F;
    }
}

ll f(int id, ll num) {
    if(size(bsuf[id]) == 0 || num == 0) return 0;

    int l=-1, r=size(bsuf[id]); 
    while(r-l > 1) {
        int mid = (l+r)/2;
        if(bsuf[id][mid].F<=hbd[id]) r = mid;
        else l = mid;
    }
    if(r < size(bsuf[id])) {
        hbd[id] -= bsuf[id][r].F;
    }

    if(r == 0) return 0;
    if(r==1 || bsuf[id][r-2].F <= num) {
    res += (bsuf[id][0].S - (bsuf[id][r-1].S));
    ll now = (bsuf[id][0].F - (bsuf[id][r-1].F));
    num -= now;
    res += (bsuff[id][r-1].S*min(num, bsuff[id][r-1].F-hbd[id]));
    now += (min(num, bsuff[id][r-1].F-hbd[id]));
    return now;
    }

    l=-1;
    while(r-l>1) {
        int mid = (l+r)/2;
        if(bsuf[id][0].F - bsuf[id][mid].F<=num) l = mid;
        else r = mid;
    }
    ll now = bsuf[id][0].F - bsuf[id][l].F;
    num -= now;
    res += (bsuf[id][0].S - bsuf[id][l].S);
    now += min(num, bsuff[id][l].F);
    res += (min(num, bsuff[id][l].F)*bsuff[id][l].S);
    num -= now;
    return now;
}

ll qry(int id, ll w) {
    vector<pll> tmp;
    ll sdel = 0;
    for(int i=L[b[id]]; i<=id-1; i++) {
        if(mark[i] == 0) continue;
        if(typ[i] == 1) tmp.pb({Q[i][2], Q[i][3]});
        else {
            ll num = Q[i][2];
            while(size(tmp) > 0 && num > 0) {
                if(tmp.back().F <= num) {
                    num -= tmp.back().F;
                    tmp.pop_back();
                } else {
                    tmp.back().F -= num; num = 0;
                }
            }
            sdel += num;
        }
    }

    for(int i=b[id]-1; i>=1; i--) {
        if(size(bsuf[i]) > 0) {
            if(sdel >= bsuf[i][0].F) {
                hbd[i] = bsuf[i][0].F; sdel -= hbd[i];
            } else {
                hbd[i] = sdel; sdel = 0;
            } sdel += bdel[i];
        } else {
            hbd[i] = 0;
            sdel += bdel[i]; 
        }
    }

    res = 0;
    for(int i=1; i<b[id]; i++) {
        w -= f(i, w);
    }
    for(auto it : tmp) {
        if(it.F <= w) {
            w -= it.F; res += (it.F*it.S);
        } else {
            res += (w * it.S);
            w = 0;
        }
    }

    return res;
}

int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);
	cin>>n>>m;

    for(int i=1; i<=m; i+=SQ) {
        cntb++; L[cntb]=i,R[cntb]=min(i+SQ-1, m);
        for(int j=L[cntb]; j<=R[cntb]; j++) b[j] = cntb;
    }

    for(ll l,r,x,y,i=1; i<=m; i++) {
        cin>>typ[i]>>l>>r>>x;
        if(typ[i] == 1) {
            cin>>y; Q[i] = {l, r, x, y};
        } else {
            Q[i] = {l, r, x};
        }
        if(typ[i] == 3) Q3[l].pb(i);
        else Q2[l].pb(i), Q2[r+1].pb(i);
    }

    for(int i=1; i<=n; i++) {
        for(auto it : Q2[i]) {
            mark[it] ^= 1;
            calc(b[it]);
        }
        for(auto it : Q3[i]) {
            ans[it] = qry(it, Q[it][2]) - qry(it, Q[it][1]-1);
        }
    }

    for(int i=1; i<=m; i++) {
        if(typ[i] == 3) cout<<ans[i]<<endl;
    }

	return 0;
}