#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()) {
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t) {
	stringstream ss;
	ss << f;
	ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x)
#define debug(x)
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

int h, w;

bool inside(int y, int x) {
	return 0 <= y && y < h && 0 <= x && x < w;
}


void mainmain() {
	int n, m;
	cin >> n >> m;
	vector<pll> v(n);
	vll x;
	vll y;
	rep(i, n) {
		cin >> v[i].S >> v[i].F;
		y.PB(v[i].F);
		x.PB(v[i].S);
	}
	y.PB(-INFL);
	y.PB(INFL);
	x.PB(-INFL);
	x.PB(INFL);
	sort(ALL(y));
	y.erase(unique(ALL(y)), y.end());
	sort(ALL(x));
	x.erase(unique(ALL(x)), x.end());
	h = y.size();
	w = x.size();
	vvint vv;
	initvv(vv, y.size(), x.size());
	vvint sum = vv;
	rep(i, n) {
		int yy = lower_bound(ALL(y), v[i].F) - y.begin();
		int xx = lower_bound(ALL(x), v[i].S) - x.begin();
		vv[yy][xx]++;
	}
	rep(i, h) {
		rep(j, w) {
			int a = (inside(i - 1, j) ? sum[i - 1][j] : 0);
			int b = (inside(i, j - 1) ? sum[i][j - 1] : 0);
			int c = (inside(i - 1, j - 1) ? sum[i - 1][j - 1] : 0);
			sum[i][j] = a + b - c + vv[i][j];
		}
	}
	rep(i, m) {
		ll a, b, c, d;
		cin >> a >> b >> c >> d;
		int bb = lower_bound(ALL(y), b) - y.begin();
		int aa = lower_bound(ALL(x), a) - x.begin();
		int dd = upper_bound(ALL(y), d) - y.begin();
		dd--;
		int cc = upper_bound(ALL(x), c) - x.begin();
		cc--;
		// cout << aa << " " << bb << " " << cc << " " << dd << endl;
		ll ans = sum[dd][cc];
		if(inside(bb - 1, cc)) ans -= sum[bb - 1][cc];
		if(inside(dd, aa - 1)) ans -= sum[dd][aa - 1];
		if(inside(bb-1, aa - 1)) ans += sum[bb - 1][aa - 1];
		cout << ans << endl;
	}
}


signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(20);
	mainmain();
}

Measured memory_bytes: 198784