#include<bits/stdc++.h>
#define lc(x) (t[x].lc)
#define rc(x) (t[x].rc)
#define lowbit(x) (x&(-x))
using namespace std;
typedef long long ll;
typedef vector<int> vec; 
typedef array<int,2> pr;
typedef array<int,4> qr; //(x,y,type,id)
const int MAXN = 1e6+10,INF = 1e9;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}
//
int n,m,x[MAXN],y[MAXN];
int o[MAXN],mx[MAXN],my[MAXN],qx[MAXN],qy[MAXN],ans[MAXN];

vec ap[MAXN]; int mt[MAXN],qt[MAXN];

struct BIT{
    int t[MAXN];
    void mdf(int x,int v){x=n-x+1;for(;x<=n;x+=lowbit(x))t[x] += v;}
    int qry(int x,int S=0){x=n-x+1;for(;x;x-=lowbit(x))S+=t[x]; return S;}
}tx,ty,tz;

namespace Pre{
    qr mdf[MAXN*3]; int tot;
    struct BIT{
        int t[MAXN];
        void init(){fill(t+1,t+1+n,INF);}
        void mdf(int x,int v){x=n-x+1;for(;x<=n;x+=lowbit(x))tomin(t[x],v);}
        int qry(int x,int S=INF){x=n-x+1;for(;x;x-=lowbit(x))tomin(S,t[x]);return S;}
    }bit;
    void solve(){
        for(int i=1;i<=n;i++)mdf[++tot] = (qr){x[i],y[i],1,i};
        for(int i=1;i<=m;i++)mdf[++tot] = (qr){mx[i],my[i],3,i},mdf[++tot] = (qr){qx[i],qy[i],2,i};
        sort(mdf+1,mdf+1+tot);
        bit.init();
        for(int i=tot;i>=1;i--){
            qr& now = mdf[i]; int id = now[3],type = now[2],y = now[1];
            if(type == 3)bit.mdf(y,id);
            else if(type == 1){
                mt[id] = bit.qry(y);
                if(mt[id] != INF)ap[mt[id]].push_back(id);
            }else qt[id] = bit.qry(y);
        }
    }
}
namespace DS{
    mt19937 rnd(0);
    struct Node{
        int lc,rc,sz,key;
        int vx,vy,tx,ty;
        Node(){key = rnd(),tx = ty = -1;}
    }t[MAXN]; int tot,rt;
    void pu(int x){ t[x].sz = t[lc(x)].sz + 1 + t[rc(x)].sz; }
    void cx(int x,int v){if(!x)return; t[x].vx = t[x].tx = v;}
    void cy(int x,int v){if(!x)return; t[x].vy = t[x].ty = v;}
    void pd(int x){
        if(t[x].tx != -1)cx(lc(x),t[x].tx),cx(rc(x),t[x].tx),t[x].tx = -1;
        if(t[x].ty != -1)cy(lc(x),t[x].ty),cy(rc(x),t[x].ty),t[x].ty = -1;
    }
    int cn(int x,int y){
        tot++;
        t[tot].vx = x,t[tot].vy = y,t[tot].sz = 1;
        return tot;
    }
    //
    int merge(int x,int y){
        if(!x || !y)return x+y;
        pd(x); pd(y);
        if(t[x].key > t[y].key){
            rc(x) = merge(rc(x),y);
            return pu(x),x;
        }else{
            lc(y) = merge(x,lc(y));
            return pu(y),y;
        }
    }
    void split(int u,int limx,int limy,int& x,int& y){
        if(!u)return void(x=y=0);
        pd(u);
        if(t[u].vx <= limx && t[u].vy >= limy){
            x = u;
            split(rc(x),limx,limy,rc(x),y);
        }else{
            y = u;
            split(lc(y),limx,limy,x,lc(y));
        }
        pu(u);
    }
    //
    void insert(int x,int y){
        int a = 0,b = cn(x,y),c = 0;
        split(rt,x,y,a,c);
        rt = merge(merge(a,b),c);
    }    
    void preget(int x,int y,int& a,int& b,int& c){
        split(rt,0,y+1,a,b);
        split(b,x,0,b,c);
    }
    int qry(int x,int y){
        int a = 0,b = 0,c = 0;
        preget(x,y,a,b,c);
        int ans = t[b].sz;
        rt = merge(merge(a,b),c);
        return ans;
    }
    void mdf(int o,int x,int y){
        int a = 0,b = 0,c = 0;
        preget(x,y,a,b,c);
        if(o == 1)cy(b,y); else cx(b,x);
        rt = merge(merge(a,b),c);
    }
}

qr mdf[MAXN*2]; int tot;

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>x[i]>>y[i],tx.mdf(x[i],1),ty.mdf(y[i],1);
    for(int i=1;i<=m;i++)cin>>o[i]>>mx[i]>>my[i]>>qx[i]>>qy[i];
    
    Pre::solve();
    for(int i=1,A=n;i<=m;i++){  
        DS::mdf(o[i],mx[i],my[i]);

        for(auto id : ap[i]){
            tx.mdf(x[id],-1),ty.mdf(y[id],-1); A--; 
            if(o[i] == 1)DS::insert(x[id],my[i]);
            else DS::insert(mx[i],y[id]);
        }   
        //
        ans[i] = DS::qry(qx[i],qy[i]);
        if(qt[i] <= i)continue; 
        ans[i] += A; ans[i] -= tx.qry(qx[i]+1) + ty.qry(qy[i]+1);
        mdf[++tot] = {qx[i]+1,qy[i]+1,1,i};
    }
    for(int i=1;i<=n;i++)mdf[++tot] = {x[i],y[i],2,-1};
    sort(mdf+1,mdf+1+tot);
    for(int i=tot;i>=1;i--){
        qr& now = mdf[i]; int y = now[1],type = now[2],id = now[3];
        if(type==2)tz.mdf(y,1);
        else ans[id] += tz.qry(y);
    }
    for(int i=1;i<=m;i++)cout<<ans[i]<<"\n";
    return 0;
}