#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define rint register int

using namespace std;

typedef long long ll;

inline int Min(int a,int b){return a<b?a:b;}

inline int Max(int a,int b){return a>b?a:b;}

void gi(int &x){

    static char c=getchar();x=;

    while(c<''||c>'') c=getchar();

    while(''<=c&&c<='') x=x*+(c^),c=getchar();

}

void gll(ll &x){

    static char c=getchar();x=; bool f=;

    while(c<''||c>'') f=f&&(c!='-'),c=getchar();

    while(''<=c&&c<='') x=x*+(c^),c=getchar();

    x=f?x:-x;

}

#define N 50005

#define W 20000005

int n,m,u,tn,opt[N],L[N],R[N],b[N],rt[],lc[W],rc[W],add[W];

ll k[N],sum[W];

#define mid (l+r)/2

void Add(int &o,int l,int r,int x1,int x2){

    if(!o) o=++u;

    sum[o]+=Max(Min(x2,r)-Max(x1,l)+,);//遍历过程中先处理掉sum

    if(x1<=l&&r<=x2){++add[o]; return ;}//标记永久化

    if(x1<=mid) Add(lc[o],l,mid,x1,x2);

    if(x2>mid) Add(rc[o],mid+,r,x1,x2);

}

ll Ask(int o,int l,int r,int x1,int x2,ll t){

    if(!o) return t*Max(Min(x2,r)-Max(x1,l)+,);//注意不返回0

    if(x1<=l&&r<=x2) return sum[o]+t*(r-l+);

    ll re=;

    if(x1<=mid) re+=Ask(lc[o],l,mid,x1,x2,t+add[o]);//累加路径上的标记

    if(x2>mid) re+=Ask(rc[o],mid+,r,x1,x2,t+add[o]);

    return re;

}

void ins(int o,int l,int r,int x1,int x2,int v){

    Add(rt[o],,n,x1,x2);

    if(l==r) return ;

    if(v<=mid) ins(o<<,l,mid,x1,x2,v);

    else ins(o<<|,mid+,r,x1,x2,v);

}

int ask(int o,int l,int r,int x1,int x2,ll v){

    if(l==r) return b[l];

    ll tmp=Ask(rt[o<<|],,n,x1,x2,);

    if(v<=tmp) return ask(o<<|,mid+,r,x1,x2,v);

    else return ask(o<<,l,mid,x1,x2,v-tmp);

}

int main(){

    gi(n);gi(m);

    for(rint i=;i<=m;++i){

        gi(opt[i]);gi(L[i]);gi(R[i]);gll(k[i]);

        if(opt[i]==) b[++tn]=k[i];

    }sort(b+,b+tn+);

    tn=unique(b+,b+tn+)-b-;//离散化

    for(rint i=;i<=m;++i)

        if(opt[i]==) k[i]=lower_bound(b+,b+tn+,k[i])-b;

    for(rint i=;i<=m;++i){

        if(opt[i]==) ins(,,tn,L[i],R[i],k[i]);

        else printf("%d\n",ask(,,tn,L[i],R[i],k[i]));

    }return ;

}