#include <bits/stdc++.h>
#define REP(i, first, last) for (int i = (first); i <= (last); ++i)
#define DOW(i, first, last) for (int i = (first); i >= (last); --i)
using namespace std;
#define int long long
#define pb emplace_back
#define ull unsigned long long
const int N = 1e6 + 5, M = 2e5 + 5, Sg = 26;
const int mod1 = 1e9 + 9, mod2 = 998244353;
const long long inf = 1e18;
const int dx[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
const int P = 1ll << 21, S = P - 1;
int n, q, l[N], r[N], ans[N];
vector<pair<int, int> > vec[N];
template <typename Type>
struct Fenwick {
  int n;
  vector<Type> c;
  int lowbit(int x) { return x & (-x); }
  void resize(int x) { n = x, c.resize(n + 1); }
  void clear() { c.assign(n + 1, 0); }
  void upd(int x, Type val) {
    for (; x <= n; x += lowbit(x)) c[x] += val;
  }
  Type ask(int x) {
    Type r = 0;
    for (x = min(x, n); x; x -= lowbit(x)) r += c[x];
    return r;
  }
  int find(int x, int k) {
    int sum = 0, ans = 0;
    DOW(i, 20, 0)
    if (((ans + 1 << i) <= k) && sum + c[ans + (1 << i)] >= x) 
    	ans += 1 << i, sum += c[ans];
    // cerr << ans << '\n';
    return ans;
  }
};
Fenwick<int> f;
void Solve() {
  cin >> n >> q, f.resize(n + 5);
  REP(i, 1, n) cin >> l[i] >> r[i];
  REP(i, 1, q) {
    int l, r;
    cin >> l >> r;
    vec[r].pb(l, i);
  }
  REP(i, 1, n) {
    int x = f.find(r[i] + 1, i) + 1, y = f.find(l[i], i);
    if (x <= y) f.upd(x, 1), f.upd(y + 1, -1);
    // cerr << x << ' ' << y << '\n';
    for (auto p : vec[i]) ans[p.second] = f.ask(p.first);
  }
  REP(i, 1, q) cout << ans[i] << '\n';
}
signed main() {
  //	freopen(".in", "r", stdin);
  //	freopen(".out", "w", stdout);
  ios::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  int T = 1;
  //	cin >> T;
  while (T--) {
    Solve();
  }
  return 0;
}