// Author: Kajetan Ramsza
#include "bits/stdc++.h"
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

template<typename F, typename S> ostream& operator<<(ostream& os, const pair<F, S> &p) { return os<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T> ostream &operator<<(ostream & os, const vector<T> &v) { os << "{"; typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) { if( it != v.begin() ) os << ", "; os << *it; } return os << "}"; }

template<typename T> ostream &operator << ( ostream & os, const multiset< T > &v ) {
    os << "[";
    typename set< T > :: const_iterator it;
    for ( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "]";
}

template < typename F, typename S >
ostream &operator << ( ostream & os, const map< F, S > &v ) {
    os << "[";
    typename map< F , S >::const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << it -> first << " = " << it -> second ;
    }
    return os << "]";
}

void dbg_out() { cerr<<'\n'; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr<<' '<<H; dbg_out(T...); }

#ifdef DEBUG
#define dbg(...) cerr<<"(" << #__VA_ARGS__ <<"):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 
#endif


struct FenwickTree {
	vector<int> s;
	FenwickTree(int n) : s(n) {}
	void update(int pos, int dif) { // a[pos] += dif
		dbg(pos, dif);
		for (; pos < sz(s); pos |= pos + 1) s[pos] += dif;
	}
	int query(int pos) { // sum of values in [0, pos)
		dbg(pos, s);
		int res = 0;
		for (; pos > 0; pos &= pos - 1) res += s[pos-1];
		dbg(res);
		return res;
	}
};

int n, q;
vector<pii> rect;

vector<pii> sorted;
vi vals;
vi ind;

FenwickTree *tree;

struct query {
	int a, b;
	int index;

	friend bool operator<(const query &a, const query &b) {
		return a.a > b.a;
	}
};

int qpnt = 0;
vector<query> queries;
vi res;

void check_queries(int v) {
	// dbg(v);
	for(;qpnt < q && v < queries[qpnt].a;qpnt++) {
		dbg(qpnt, queries[qpnt].a, queries[qpnt].b);
		int b = 0, e = sz(vals);
		while(b < e) {
			int mid = (b+e) / 2;
			if(vals[mid] <= queries[qpnt].b) b = mid + 1;
			else e = mid;
		}
		dbg(b, queries[qpnt].index);
		res[queries[qpnt].index] += tree->query(b);
		dbg("asdas");
	}
}

void solve() {
	set<pii> s;
	int pnt = 0;
	while(pnt < n) {
		check_queries(rect[pnt].first);
		int end = pnt;
		while(end < n && rect[end].first == rect[pnt].first)
			end++;
		// dbg(pnt, end);

		rep(i,pnt,end) {
			// dbg(i, rect[i], ind[i]);
			tree->update(ind[i], 1);
			auto it = s.upper_bound({rect[i].second, n});
			if(it == s.end()) {
				continue;
			}
			auto [val, index] = *it;
			// dbg(val, index);
			tree->update(ind[index], -1);
			s.erase(it);
		}
			
		rep(i,pnt,end) s.insert({rect[i].second, i});
		pnt = end;
	}
	check_queries(0);
}

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

	cin>>n>>q;
	rect.resize(n);
	rep(i,0,n) cin>>rect[i].first>>rect[i].second;
	sort(all(rect), greater<>());
	dbg(rect);
	sorted.resize(n);
	rep(i,0,n) sorted[i] = {rect[i].second, i};
	sort(all(sorted));
	dbg(sorted);
	ind.resize(n);
	rep(i,0,n) {
		if(vals.empty() || vals.back() != sorted[i].first)
			vals.push_back(sorted[i].first);
		ind[sorted[i].second] = sz(vals) - 1;
	}
	dbg(ind);
	queries.resize(q);
	rep(i,0,q) {
		cin>>queries[i].a>>queries[i].b;
		queries[i].index = i;
	}
	sort(all(queries));
	res.resize(q);
	tree = new FenwickTree(sz(vals));
	solve();
	rep(i,0,q)
		cout<<res[i]<<'\n';
}