#include<iostream>
#include<cstdio>
#include<vector>
#define N 100000
using namespace std;
const int inf=(int)(2e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int t,num,data,stype,sdata,type;
};
struct rds
{
	int t,l,r,k,maxn,minn;
};
int n,q,sn,op[N+1],a[N+1],b[N+1],c[N+1];
long long c2[N+1],ans[N+1];
int lowbit(int x)
{
	return x&(-x);
}
void add(int x,int d)
{
	for (;x<=n;x+=lowbit(x)) c[x]+=d;
	return;
}
int query(int x)
{
	int res=0;
	for (;x>=1;x-=lowbit(x)) res+=c[x];
	return res;
}
void add2(int x,int d)
{
	for (;x<=n;x+=lowbit(x)) c2[x]+=d;
	return;
}
long long query2(int x)
{
	long long res=0;
	for (;x>=1;x-=lowbit(x)) res+=c2[x];
	return res;
}
void clear(int x)
{
	for (;x<=n;x+=lowbit(x)) c[x]=0;
	return;
}
void clear2(int x)
{
	for (;x<=n;x+=lowbit(x)) c2[x]=0;
	return;
}
struct seg
{
	int maxn[(N<<2)+1];
	void change(int x,int d)
	{
		x+=sn,maxn[x]=d;
		while (x!=1) x>>=1,maxn[x]=max(maxn[x<<1],maxn[x<<1|1]);
		return;
	}
	int query(int l,int r)
	{
		int res;
		l+=sn,r+=sn,res=max(maxn[l],maxn[r]);
		while ((l>>1)!=(r>>1))
		{
			if (!(l&1)) res=max(res,maxn[l^1]);
			if (r&1) res=max(res,maxn[r^1]);
			l>>=1,r>>=1;
		}
		return res;
	}
};
seg T;
struct seg2
{
	int minn[(N<<2)+1];
	void change(int x,int d)
	{
		x+=sn,minn[x]=d;
		while (x!=1) x>>=1,minn[x]=min(minn[x<<1],minn[x<<1|1]);
		return;
	}
	int query(int l,int r)
	{
		int res;
		l+=sn,r+=sn,res=min(minn[l],minn[r]);
		while ((l>>1)!=(r>>1))
		{
			if (!(l&1)) res=min(res,minn[l^1]);
			if (r&1) res=min(res,minn[r^1]);
			l>>=1,r>>=1;
		}
		return res;
	}
};
seg2 T2;
void solve(int l,int r,vector<rds>&st,vector<reads>&v,vector<reads>&v2)
{
	if (st.empty()) return;
	if (l==r)
	{
		int ps=-1;
		for (int i=0;i<st.size();++i)
		{
			while (ps+1<v.size()&&v[ps+1].t<=st[i].t)
			{
				++ps;
				if (v[ps].type==1) add(v[ps].num,v[ps].stype),T.change(v[ps].num,v[ps].sdata);
				else add(v[ps].num,-v[ps].stype),T.change(v[ps].num,0);
			}
			ans[st[i].t]+=1ll*l*st[i].k,st[i].maxn=max(st[i].maxn,T.query(st[i].l,st[i].r));
			if ((st[i].k&1)&&query(st[i].r)-query(st[i].l-1)==0) ans[st[i].t]+=min(l-st[i].maxn,st[i].minn-l);
		}
		for (int i=0;i<=ps;++i) clear(v[i].num),T.change(v[i].num,0);
		return;
	}
	int mid=(0ll+l+r)>>1,d,ps=-1,ps2=-1;
	vector<rds>stA;
	vector<rds>stB;
	vector<reads>vA;
	vector<reads>vB;
	vector<reads>vA2;
	vector<reads>vB2;
	for (int i=0;i<v.size();++i)
	{
		if (v[i].data<=mid) vA.push_back(v[i]);
		else vB.push_back(v[i]);
		if (v2[i].data<=mid) vA2.push_back(v2[i]);
		else vB2.push_back(v2[i]);
	}
	for (int i=0;i<st.size();++i)
	{
		while (ps+1<v.size()&&v[ps+1].t<=st[i].t)
		{
			++ps;
			if (v[ps].data<=mid)
			{
				if (v[ps].type==1) add(v[ps].num,1),add2(v[ps].num,v[ps].data),T.change(v[ps].num,v[ps].sdata);
				else add(v[ps].num,-1),add2(v[ps].num,-v[ps].data),T.change(v[ps].num,0);
			}
		}
		while (ps2+1<v.size()&&v2[ps2+1].t<=st[i].t)
		{
			++ps2;
			if (v2[ps2].data>mid)
			{
				if (v2[ps2].type==1) T2.change(v2[ps2].num,v2[ps2].sdata);
				else T2.change(v2[ps2].num,inf);
			}
		}
		d=query(st[i].r)-query(st[i].l-1);
		if (st[i].k<=d) st[i].minn=min(st[i].minn,T2.query(st[i].l,st[i].r)),stA.push_back(st[i]);
		else ans[st[i].t]+=query2(st[i].r)-query2(st[i].l-1),st[i].maxn=max(st[i].maxn,T.query(st[i].l,st[i].r)),st[i].k-=d,stB.push_back(st[i]);
	}
	for (int i=0;i<=ps;++i)
		if (v[i].data<=mid)
			clear(v[i].num),clear2(v[i].num),T.change(v[i].num,0);
	for (int i=0;i<=ps2;++i)
		if (v2[i].data>mid)
			T2.change(v2[i].num,inf);
	st.clear(),st.shrink_to_fit(),v.clear(),v.shrink_to_fit(),v2.clear(),v2.shrink_to_fit(),solve(l,mid,stA,vA,vA2),solve(mid+1,r,stB,vB,vB2);
	return;
}
vector<reads>v;
vector<reads>v2;
void adder(int t,int x,int d)
{
	if (a[x]<=b[x]-a[x])
	{
		v.push_back((reads){t,x,a[x]<<1,1,a[x]<<1,d}),v.push_back((reads){t,x,(b[x]-a[x])<<1,1,(b[x]-a[x])<<1,d});
		v2.push_back((reads){t,x,(b[x]-a[x])<<1,1,(b[x]-a[x])<<1,d}),v2.push_back((reads){t,x,a[x]<<1,1,a[x]<<1,d});
	}
	else
	{
		v.push_back((reads){t,x,b[x],0,(b[x]-a[x])<<1,d}),v.push_back((reads){t,x,b[x],0,(b[x]-a[x])<<1,d});
		v2.push_back((reads){t,x,b[x],0,a[x]<<1,d}),v2.push_back((reads){t,x,b[x],0,a[x]<<1,d});
	}
	return;
}
int main()
{
	vector<rds>st;
	int p,x,y,l,r,k;
	n=read(),q=read(),sn=1;
	while (sn<=n) sn<<=1;
	for (int i=1;i<=(sn<<1);++i) T2.minn[i]=inf;
	for (int i=1;i<=n;++i) a[i]=read(),b[i]=read(),adder(1,i,1);
	for (int i=1;i<=q;++i)
	{
		op[i]=read();
		if (op[i]==1) p=read()+1,x=read(),y=read(),adder(i,p,-1),a[p]=x,b[p]=y,adder(i,p,1);
		else l=read()+1,r=read()+1,k=read(),st.push_back((rds){i,l,r,k,0,inf});
	}
	solve(1,inf,st,v,v2);
	for (int i=1;i<=q;++i)
		if (op[i]==2)
			printf("%lld\n",ans[i]>>1);
	return 0;
}