#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
using pal=pair<ll,ll>;
template<typename A>
using vc=vector<A>;
inline int read()
{
    int s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
inline ll lread()
{
    ll s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
namespace S
{
    ll rest[400001];
    ll sum[400001];
    ll lrest[400001];
    ll lsum[400001];
    ll e[400001];
    pal push_up(int p,int pl,int pr,ll re)
    {
        // printf("push_up %d %d %d %lld : %lld %lld\n",p,pl,pr,re,rest[p],sum[p]);
        assert(re>=0);
        if(rest[p]<=re) return pal(0,0);
        if(pl==pr)
        {
            int val=sum[p]/rest[p];
            return pal(rest[p]-re,(rest[p]-re)*val);
        }
        int mid=(pl+pr)>>1;
        if(sum[p*2|1])
        {
            auto val=push_up(p*2|1,mid+1,pr,re);
            return pal(val.first+lrest[p],val.second+lsum[p]);
        }
        return push_up(p*2,pl,mid,re-sum[p*2|1]+e[p*2|1]);
    }
    void add(int p,int pl,int pr,int x,int c,int v)
    {
        // printf("add %d %d %d %d %d %d\n",p,pl,pr,x,c,v);
        if(pl==pr)
        {
            if(v==-1) e[p]+=c;
            else
            {
                rest[p]+=c;
                sum[p]+=(ll)c*v;
            }
            // printf("%d : %d : %lld %lld %lld\n",p,pl,rest[p],sum[p],e[p]);
            return ;
        }
        int mid=(pl+pr)>>1;
        if(x<=mid) add(p*2,pl,mid,x,c,v);
        else add(p*2|1,mid+1,pr,x,c,v);
        assert(e[p*2|1]>=0);
        auto val=push_up(p*2,pl,mid,e[p*2|1]);
        lrest[p]=val.first,lsum[p]=val.second;
        rest[p]=lrest[p]+rest[p*2|1];
        sum[p]=lsum[p]+sum[p*2|1];
        e[p]=e[p*2]+e[p*2|1]-(rest[p*2]-lrest[p]);
        // printf("%d : %d ~ %d : %lld %lld %lld\n",p,pl,pr,rest[p],sum[p],e[p]);
    }
    pal getp(int p,int pl,int pr,int l,int r,ll re)
    {
        // printf("getp %d %d %d %d %d %lld\n",p,pl,pr,l,r,re);
        if(l<=pl&&pr<=r) return pal(max(rest[p]-re,0ll),max(re-rest[p],0ll)+e[p]);
        int mid=(pl+pr)>>1;pal ans=pal(0,re);
        if(mid<r)
        {
            auto val=getp(p*2|1,mid+1,pr,l,r,ans.second);
            ans.first+=val.first,ans.second=val.second;
        }
        if(l<=mid)
        {
            auto val=getp(p*2,pl,mid,l,r,ans.second);
            ans.first+=val.first,ans.second=val.second;
        }
        // printf("%d : %d %d %d %d %lld : %lld %lld\n",p,pl,pr,l,r,re,ans.first,ans.second);
        return ans;
    }
    ll get(int p,int pl,int pr,int lim,ll l,ll r,ll re)
    {
        // printf("get %d %d %d %d %lld %lld %lld\n",p,pl,pr,lim,l,r,re);
        assert(lim>=pl);
        if(pl==pr)
        {
            ll num=sum[p]/rest[p];
            return (r-l+1)*num;
        }
        pal v1,v2=pal(0,re);ll ans=0;
        int mid=(pl+pr)>>1;
        if(mid<lim) v2=getp(p*2|1,mid+1,pr,1,lim,re);
        v1=getp(p*2,pl,mid,1,lim,v2.second);
        r=min(r,v1.first+v2.first);
        // printf("(%lld,%lld) and (%lld,%lld) : r=%lld\n",v1.first,v1.second,v2.first,v2.second,r);

        if(v1.first>=l) ans+=get(p*2,pl,mid,lim,l,min(r,v1.first),v2.second);
        l=max(l-v1.first,1ll),r-=v1.first;
        if(l<=r) ans+=get(p*2|1,mid+1,pr,lim,l,r,v2.second);
        return ans;
    }
}
struct node
{
    int tim;
    ll x,y;
};
vc<node>ned[100002];
vc<node>nod[100002];
ll qans[100002];
int n,m;
inline void run(int w)
{
    // printf("run %d\n",w);
    for(auto i:nod[w]) S::add(1,1,m,i.tim,i.x,i.y);
    for(auto i:ned[w]) qans[i.tim]=S::get(1,1,m,i.tim,i.x,i.y,0);
}
int main()
{
    n=read(),m=read();
    for(int i=1;i<=m;i++)
    {
        int op=read();qans[i]=-1;
        if(op==1)
        {
            int l=read(),r=read(),x=read(),y=read();
            nod[l].push_back(node{i,x,y});
            nod[r+1].push_back(node{i,-x,y});
        }
        else if(op==2)
        {
            int l=read(),r=read(),x=read(),y=-1;
            nod[l].push_back(node{i,x,y});
            nod[r+1].push_back(node{i,-x,y});
        }
        else
        {
            int x=read();ll l=lread(),r=lread();
            ned[x].push_back(node{i,l,r});
        }
    }
    for(int i=1;i<=n;i++) run(i);
    for(int i=1;i<=m;i++) if(qans[i]!=-1) printf("%lld\n",qans[i]);
    return 0;
}