#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=0.9e3+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,A[N],B[N],C[N],D[N],ti[N];
namespace FHQ{
	int l[N],r[N],rd[N],siz[N],cnt;
	pii val[N];pii tag[N];
	void Pf(int v,pii w){
		if(!v) return;
		if(w.fi) val[v].fi=tag[v].fi=w.fi;
		if(w.se) val[v].se=tag[v].se=w.se;
	}
	void P(int v){
		Pf(l[v],tag[v]);Pf(r[v],tag[v]);
		tag[v]=make_pair(0,0);
	}
	void up(int v){
		siz[v]=siz[l[v]]+siz[r[v]]+1;
	}
	void splitx(int x,int v,int &a,int &b){
		if(!v){a=b=0;return;}
		P(v);
		if(val[v].fi<=x) a=v,splitx(x,r[v],r[a],b);
		else b=v,splitx(x,l[v],a,l[b]);
	}
	void splity(int y,int v,int &a,int &b){
		if(!v){a=b=0;return;}
		P(v);
		if(val[v].se<=y) a=v,splity(y,r[v],r[a],b);
		else b=v,splity(y,l[v],a,l[b]);
	}
	int merge(int x,int y){
		if(!x||!y) return x+y;
		P(x);P(y);
		if(rd[x]<rd[y]) return r[x]=merge(r[x],y),up(x),x;
		else return l[y]=merge(x,l[y]),up(y),y;
	}
	int newnode(pii x){
		val[++cnt]=x;rd[cnt]=rnd();siz[cnt]=1;
		return cnt;
	}
	int rt;
	void modify(int x,int y,int op){
		int r1,r2,r3;
		splitx(-x-1,rt,r1,r2);splity(y,r2,r2,r3);
		Pf(r2,op==1?make_pair(0,y):make_pair(-x,0));
		rt=merge(r1,merge(r2,r3));
	}
	int qry(int x,int y){
		int r1,r2,r3;
		splitx(-x-1,rt,r1,r2);splity(y,r2,r2,r3);
		int w=siz[r2];
		rt=merge(r1,merge(r2,r3));
		return w;
	}
	void ins(int x,int y){
		int r1,r2,r3;
		splitx(-x-1,rt,r1,r2);splity(y,r2,r2,r3);
		rt=merge(merge(r1,r2),merge(newnode(make_pair(-x,y)),r3));
	}
}
int id[N];
namespace Tree{
	void modify(int x,int y,int op,int id){
		for(int i=1;i<=n;i++) if(!ti[i]&&A[i]<=x&&B[i]<=y){
			if(op==1) FHQ::ins(A[i],y);
			else FHQ::ins(x,B[i]);
			ti[i]=id;
			gdb(i,id);
		}
	}
}
int ans[N];
void Solve(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d%d",&A[i],&B[i]);
	for(int i=1;i<=m;i++){
		int op,x,y;
		scanf("%d%d%d%d%d",&op,&x,&y,&C[i],&D[i]);
		FHQ::modify(x,y,op);
		Tree::modify(x,y,op,i);
		ans[i]=FHQ::qry(C[i],D[i]);
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<ti[i];j++) if(A[i]<=C[j]&&B[i]<=D[j]) ans[j]++;
	}
	for(int i=1;i<=m;i++) printf("%d\n",ans[i]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}