#include<bits/stdc++.h>
using namespace std;
namespace IO {
int ow,olim=(1<<23)-100;
char buf[1<<21],*p1=buf,*p2=buf,obuf[1<<23];
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
int read() {
	int x=0; char c=gc();
	while(!isdigit(c)) c=gc();
	while(isdigit(c)) x=x*10+(c^48),c=gc();
	return x;
}
void flush() {
	fwrite(obuf,ow,1,stdout),ow=0;
}
void write(int x) {
	if(!x) obuf[ow++]='0';
	else {
		int t=ow;
		for(;x;x/=10) obuf[ow++]=(x%10)^48;
		reverse(obuf+t,obuf+ow);
	}
	if(ow>=olim) flush();
}
void putc(char c) {
	obuf[ow++]=c;
	if(ow>=olim) flush();
}
#undef gc
}
const int MAXN=1e6+5;
inline void chkmin(int &x,const int &y) { x=x<y?x:y; }
inline void chkmax(int &x,const int &y) { x=x>y?x:y; }
mt19937 rnd(time(0));
struct Treap {
	int x[MAXN],y[MAXN],tx[MAXN],ty[MAXN],pri[MAXN],ls[MAXN],rs[MAXN],siz[MAXN];
	inline void psd(const int &p) {
		if(tx[p]) x[ls[p]]=tx[ls[p]]=x[rs[p]]=tx[rs[p]]=tx[p],tx[p]=0;
		if(ty[p]) y[ls[p]]=ty[ls[p]]=y[rs[p]]=ty[rs[p]]=ty[p],ty[p]=0;
	}
	void splix(int p,const int &k,int &u,int &v) {
		if(!p) return u=v=0,void();
		psd(p);
		if(x[p]<=k) u=p,splix(rs[p],k,rs[p],v);
		else v=p,splix(ls[p],k,u,ls[p]);
		siz[p]=siz[ls[p]]+siz[rs[p]]+1;
	}
	void spliy(int p,const int &k,int &u,int &v) {
		if(!p) return u=v=0,void();
		psd(p);
		if(y[p]>=k) u=p,spliy(rs[p],k,rs[p],v);
		else v=p,spliy(ls[p],k,u,ls[p]);
		siz[p]=siz[ls[p]]+siz[rs[p]]+1;
	}
	void spliz(int p,const int &k,int &u,int &v) {
		if(!p) return u=v=0,void();
		psd(p);
		if(x[p]-y[p]<=k) u=p,spliz(rs[p],k,rs[p],v);
		else v=p,spliz(ls[p],k,u,ls[p]);
		siz[p]=siz[ls[p]]+siz[rs[p]]+1;
	}
	int merge(int u,int v) {
		if(!u||!v) return u|v;
		psd(u),psd(v);
		if(pri[u]<pri[v]) return siz[u]+=siz[v],rs[u]=merge(rs[u],v),u;
		else return siz[v]+=siz[u],ls[v]=merge(u,ls[v]),v;
	}
	inline int szx(int p,const int &k) {
		int ans=0;
		while(p) {
			psd(p);
			if(x[p]>k) p=ls[p];
			else ans+=siz[ls[p]]+1,p=rs[p];
		}
		return ans;
	}
	inline int szy(int p,const int &k) {
		int ans=0;
		while(p) {
			psd(p);
			if(y[p]<k) p=ls[p];
			else ans+=siz[ls[p]]+1,p=rs[p];
		}
		return ans;
	}
}	T;
int n,m,ax[MAXN],ay[MAXN],ux[MAXN],uy[MAXN],qx[MAXN],qy[MAXN],op[MAXN],ans[MAXN];
struct poi {
	int x,y,id;
	inline friend bool operator <(const poi &u,const poi &v) {
		return u.x^v.x?u.x>v.x:u.id>v.id;
	}
};
vector <int> ins[MAXN];
struct Bit1 {
	int tr[MAXN],s;
	void init() { fill(tr+1,tr+n+1,m+1); }
	inline void upd(int x,const int &v) { for(;x;x&=x-1) chkmin(tr[x],v); }
	inline int qry(int x) { for(s=m+1;x<=n;x+=x&-x) chkmin(s,tr[x]); return s; }
}	Tmn;
struct Bit2 {
	int tr[MAXN],s;
	inline void upd(int x,const int &v) { for(;x;x&=x-1) chkmax(tr[x],v); }
	inline int qry(int x) { for(s=0;x<=n;x+=x&-x) chkmax(s,tr[x]); return s; }
}	Tmx;
struct Bit3 {
	int tr[MAXN],s;
	inline void add(int x,const int &v) { for(;x;x&=x-1) tr[x]+=v; }
	inline int qry(int x) { for(s=0;x<=n;x+=x&-x) s+=tr[x]; return s; }
}	To,Tx,Ty;
signed main() {
	n=IO::read(),m=IO::read();
	vector <poi> Q;
	for(int i=1;i<=n;++i) ax[i]=IO::read(),ay[i]=IO::read(),Q.push_back({ax[i],ay[i],i});
	for(int i=1;i<=m;++i) {
		op[i]=IO::read(),ux[i]=IO::read(),uy[i]=IO::read();
		qx[i]=IO::read(),qy[i]=IO::read();
		Q.push_back({ux[i],uy[i],i+n});
	}
	sort(Q.begin(),Q.end());
	Tmn.init();
	for(auto o:Q) {
		if(o.id>n) Tmn.upd(o.y,o.id-n);
		else ins[Tmn.qry(o.y)].push_back(o.id);
	}
	Q.clear();
	for(int i=1;i<=n;++i) Q.push_back({ax[i],ay[i],i});
	for(int i=1;i<=m;++i) Q.push_back({qx[i],qy[i],i+n});
	sort(Q.begin(),Q.end());
	for(auto o:Q) {
		if(o.id>n) ans[o.id-n]=To.qry(o.y+1);
		else To.add(o.y,1);
	}
	for(int i=1;i<=n;++i) Tx.add(ax[i],1),Ty.add(ay[i],1);
	int rt=0;
	for(int i=1,ot=n;i<=m;++i) {
		int u,o1,o2,o3;
		T.splix(rt,ux[i],o1,o2);
		T.spliy(o1,uy[i]+1,o3,u);
		if(op[i]==2) T.x[u]=T.tx[u]=ux[i];
		else T.y[u]=T.ty[u]=uy[i];
		rt=T.merge(T.merge(o3,u),o2);
		for(int j:ins[i]) {
			Tx.add(ax[j],-1),Ty.add(ay[j],-1),--ot;
			op[i]==2?ax[j]=ux[i]:ay[j]=uy[i];
			T.spliz(rt,ax[j]-ay[j],o1,o2);
			T.x[j]=ax[j],T.y[j]=ay[j],T.pri[j]=rnd(),T.siz[j]=1;
			rt=T.merge(T.merge(o1,j),o2);
		}
		Tmx.upd(ux[i],uy[i]);
		if(Tmx.qry(qx[i]+1)>qy[i]) { IO::putc('0'),IO::putc('\n'); continue; }
		int tmp=T.szx(rt,ux[i]);
		T.splix(rt,ux[i],o1,o2);
		assert(tmp==T.siz[o1]);
		T.spliy(o1,uy[i]+1,o3,u);
		ans[i]+=ot+T.siz[u];
		ans[i]-=Tx.qry(qx[i]+1)+Ty.qry(qy[i]+1);
		IO::write(ans[i]),IO::putc('\n');
	}
	IO::flush();
	return 0;
}