/*
  ! Though life is hard, I want it to be boiling.
  ! Created: 2024/05/21 20:49:33
*/
#include <bits/stdc++.h>
using namespace std;

#define x first
#define y second
// #define int long long
#define mp(x, y) make_pair(x, y)
#define eb(...) emplace_back(__VA_ARGS__)
#define fro(i, x, y) for (int i = (x); i <= (y); i++)
#define pre(i, x, y) for (int i = (x); i >= (y); i--)
inline void JYFILE19();

typedef long long i64;
typedef pair<int, int> PII;

bool ST;
const int N = 1e6 + 10;
const int mod = 998244353;

int n, m, t[N], L[N], R[N], ls[N], rs[N], ans[N];
vector<int> to[N];

inline int lb(int x) { return x & (-x); }
inline void upd(int x, int k) { while (x <= n) t[x] += k, x += lb(x); }
inline int ask(int x) { int r = 0; while (x) r += t[x], x -= lb(x); return r; }
inline void clr() { memset(t, 0, sizeof t); }

signed main() {
  JYFILE19();
  cin >> n >> m;
  fro(i, 1, n) {
    int x, y, l, r, num;
    cin >> x >> y;
    l = 1, r = i, num = i;
    while (l <= r) {
      int mid = (l + r) >> 1, sum = ask(mid);
      if (x <= sum) num = mid, l = mid + 1;
      else r = mid - 1;
    }
    rs[i] = num;
    l = 1, r = i, num = i + 1;
    while (l <= r) {
      int mid = (l + r) >> 1, sum = ask(mid);
      if (sum <= y) num = mid, r = mid - 1;
      else l = mid + 1;
    }
    ls[i] = num;
    upd(ls[i], 1), upd(rs[i] + 1, -1);
  }
  clr();
  fro(i, 1, m) cin >> L[i] >> R[i], to[R[i]].eb(i);
  fro(i, 1, n) {
    upd(ls[i], 1), upd(rs[i] + 1, -1);
    for (auto j : to[i]) {
      ans[j] = ask(L[j]);
    }
  }
  fro(i, 1, m) cout << ans[i] << "\n";
  return 0;
}

bool ED;
inline void JYFILE19() {
  // freopen("", "r", stdin);
  // freopen("", "w", stdout);
  srand(random_device{}());
  ios::sync_with_stdio(0), cin.tie(0);
  double MIB = fabs((&ED - &ST) / 1048576.), LIM = 512;
  cerr << "MEMORY: " << MIB << endl, assert(MIB <= LIM);
}