# include <bits/stdc++.h>
using namespace std;
using ll=long long;
struct Info
{
	bool tp;
	int x,y;
	ll z;
	Info(){}
	Info(bool t,int x,int y,ll z):tp(t),x(x),y(y),z(z){}
	Info operator+(const Info &t)const
	{
		if(tp)
		{
			if(t.tp)
			{
				if(x>t.y) return Info(0,x,t.y,x-t.y);
				else if(y<t.x) return Info(0,y,t.x,0);
				else return Info(1,max(x,t.x),min(y,t.y),0);
			}
			else
			{
				if(x>t.x) return Info(0,x,t.y,t.z+x-t.x);
				else if(y<t.x) return Info(0,x,t.y,t.z);
				else return t;
			}
		}
		else
		{
			if(t.tp)
			{
				if(t.x>y) return Info(0,x,t.x,z);
				else if(t.y<y) return Info(0,x,t.y,z+y-t.y);
				else return *this;
			}
			else return Info(0,x,t.y,z+t.z+max(y-t.x,0));
		}
	}
};
struct Seg
{
	int L[300010],R[300010],pos[300010];
	Info val[1100000];
	inline void pushup(int rt){val[rt]=val[rt*2]+val[rt*2+1];}
	void build(int rt,int l,int r)
	{
		if(l==r) return val[pos[l]=rt]=Info(1,L[l],R[l],0),void();
		int mid=(l+r)/2;
		build(rt*2,l,mid);
		build(rt*2+1,mid+1,r);
		pushup(rt);
	}
	void update(int x,int l,int r)
	{
		int u=pos[x];
		val[u]=Info(1,L[x]=l,R[x]=r,0);
		for(u/=2;u;u/=2) pushup(u);
	}
	Info query(int rt,int l,int r,int x,int y)
	{
		if(l>=x && r<=y) return val[rt];
		int mid=(l+r)/2;
		if(y<=mid) return query(rt*2,l,mid,x,y);
		else if(x>mid) return query(rt*2+1,mid+1,r,x,y);
		else return query(rt*2,l,mid,x,y)+query(rt*2+1,mid+1,r,x,y);
	}
}S1,S2;
int main()
{
	int n,m,l,r,op,x1,x2,t1,t2;
	cin>>n>>m;
	for(int i=1;i<n;i++)
	{
		scanf("%d%d",&l,&r);
		S1.L[i]=l-i;S1.R[i]=r-i-1;
		S2.L[n-i]=l-(n-i);S2.R[n-i]=r-(n-i)-1;
	}
	S1.build(1,1,n-1);
	S2.build(1,1,n-1);
	while(m--)
	{
		scanf("%d",&op);
		if(op==1)
		{
			scanf("%d%d%d",&x1,&l,&r);
			S1.update(x1,l-x1,r-x1-1);
			S2.update(n-x1,l-(n-x1),r-(n-x1)-1);
		}
		else
		{
			scanf("%d%d%d%d",&x1,&t1,&x2,&t2);
			if(x1==x2) printf("%d\n",max(t1-t2,0));
			else if(x1<x2)
				printf("%lld\n",(Info(0,t1-x1,t1-x1,0)+S1.query(1,1,n-1,x1,x2-1)+Info(0,t2-x2,t2-x2,0)).z);
			else
				printf("%lld\n",(Info(0,t1-(n-x1+1),t1-(n-x1+1),0)+S2.query(1,1,n-1,n-x1+1,n-x2)+Info(0,t2-(n-x2+1),t2-(n-x2+1),0)).z);
		}
	}
	return 0;
}