#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << x << endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX
#define MAX_N 1000000001

int n, m;
P treasure[5000];

int main(){
    cin.sync_with_stdio(false);
    cin >> n >> m;
    rep(i, n) {
        int x, y;
        cin >> x >> y;
        treasure[i] = P(x, y);
    }
    sort(treasure, treasure + n);

    rep(i, m) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        int up = upper_bound(treasure, treasure + n, P(x2, INF)) - treasure;
        int low = lower_bound(treasure, treasure + n, P(x1, -INF)) - treasure;
        int cnt = 0;
        repl(j, low, up) {
            if (y1 <= treasure[j].se && treasure[j].se <= y2) cnt++;
        }
        cout << cnt << endl;
    }

    return 0;
}