#include<bits/stdc++.h>
using namespace std;
int n_,m_,a[200100],qc[200100],n;
int OP[201000],W[201000];
#define pb push_back
#define ll long long
vector<int>ga[200100],gb[201000],gc[201000];
ll ans[200100];
int mi[800100];
ll s1[800100],s2[801000];
int lf[801000];
ll as1(int p,int z){
    if(z<=mi[p])return 0;if(lf[p])return qc[lf[p]];
    if(z<=mi[p<<1])return as1(p<<1|1,z);
    return as1(p<<1,z)+s1[p]-s1[p<<1];
}
ll as2(int p,int z){
    if(z<=mi[p])return 0;if(lf[p])return qc[lf[p]];
    if(z<=mi[p<<1|1])return as2(p<<1,z);
    return as2(p<<1|1,z)+s2[p]-s2[p<<1|1];
}
void sc(int p){
    mi[p]=min(mi[p<<1],mi[p<<1|1]);
    s1[p]=s1[p<<1]+as1(p<<1|1,mi[p<<1]);
    s2[p]=s2[p<<1|1]+as2(p<<1,mi[p<<1|1]);
}
void build(int p,int l,int r){
    if(l==r){mi[p]=a[l],lf[p]=l,s1[p]=s2[p]=qc[l];return;}
    int mid=(l+r)>>1;
    build(p<<1,l,mid),build(p<<1|1,mid+1,r);
    sc(p);
}
int pv;ll ns;
void ask1(int p,int l,int r,int x){
    if(x==l){ns+=as1(p,pv),pv=min(pv,mi[p]);return;}
    int mid=(l+r)>>1;
    if(x>mid)ask1(p<<1|1,mid+1,r,x);
    else ask1(p<<1,l,mid,x),ask1(p<<1|1,mid+1,r,mid+1);
}
void ask2(int p,int l,int r,int x){
    if(x==r){ns+=as2(p,pv),pv=min(pv,mi[p]);return;}
    int mid=(l+r)>>1;
    if(x<=mid)ask2(p<<1,l,mid,x);
    else ask2(p<<1|1,mid+1,r,x),ask2(p<<1,l,mid,mid);
}
int al(int p,int l,int r,int x,int z){
    if(mi[p]>z)return 0;
    if(l==r)return l;
    int mid=(l+r)>>1;
    if(x>mid)return al(p<<1|1,mid+1,r,x,z);
    int ak=al(p<<1,l,mid,x,z);if(ak)return ak;
    return al(p<<1|1,mid+1,r,x,z);
}
int ar(int p,int l,int r,int x,int z){
    if(mi[p]>z)return 0;
    if(l==r)return l;
    int mid=(l+r)>>1;
    if(x<=mid)return ar(p<<1,l,mid,x,z);
    int ak=ar(p<<1|1,mid+1,r,x,z);if(ak)return ak;
    return ar(p<<1,l,mid,x,z);
}
void up(int p,int l,int r,int x,int z){
    if(l==r){a[l]=mi[p]=z;return;}
    int mid=(l+r)>>1;
    if(x<=mid)up(p<<1,l,mid,x,z);
    else up(p<<1|1,mid+1,r,x,z);sc(p);
}
int main(){
    scanf("%d%d",&n_,&m_);
    for(int i=1,l,r;i<=m_;i++){
        scanf("%d",&OP[i]);
        if(OP[i]==1)
        scanf("%d%d%d",&l,&r,&W[i]),qc[++n]=W[i],
        ga[l].pb(i),gb[r+1].pb(i);
        else scanf("%d%d",&l,&W[i]),qc[++n]=W[i],gc[l].pb(i);
    }
    sort(qc+1,qc+n+1);n=unique(qc+1,qc+n+1)-qc-1;
    for(int i=1;i<=m_;i++)W[i]=lower_bound(qc+1,qc+n+1,W[i])-qc;
    for(int i=1;i<=n;i++)a[i]=m_+1;build(1,1,n);
    for(int i=1;i<=n_;i++){
        for(int x:gb[i])up(1,1,n,W[x],m_+1);
        for(int x:ga[i])up(1,1,n,W[x],x);
        for(int j:gc[i]){
            int x=W[j],l=ar(1,1,n,x,j),r=al(1,1,n,x,j);
            if(!l&&!r)continue;
            if(!l||!r)x=l|r;
            else x=(a[l]>a[r])?l:r;
            pv=m_+1,ns=0;ask1(1,1,n,x),ans[j]+=ns;
            pv=m_+1,ns=0;ask2(1,1,n,x),ans[j]+=ns;
            ans[j]-=qc[x];
        }
    }
    for(int i=1;i<=m_;i++)if(OP[i]==2)printf("%lld\n",ans[i]);
    return 0;
}