#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
template <class T ENABLE_IF_INT>
constexpr T INF = numeric_limits<T>::max() >> 1;
#endif

#if !defined(_WIN32) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define For(i, j, k) for (decltype(j - k) i = (j); i <= (k); ++i)     // NOLINT
#define ForDown(i, j, k) for (decltype(j - k) i = (j); i >= (k); --i) // NOLINT
#define pb push_back
#define eb emplace_back
#ifndef ONLINE_JUDGE
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)
#else
#define FileIO(filename) void(0)
#endif

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
#define lg(x) (31 ^ __builtin_clz((x)))
#define lgll(x) (31ll ^ __builtin_clzll((x)))
template<typename T> constexpr il T sq(const T & x){ return x * x; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y);}
template<typename T> CONSTEXPR_FUNC il T qpow(T x, ull y, T mod){T ans = 1; x %= mod; while (y) { if(y & 1)(ans *= x) %= mod;(x *= x) %= mod; y >>= 1;} return ans;}
template<typename T> CONSTEXPR_FUNC il T qpow(T x, ull y){T ans = 1; while (y) {if(y & 1) ans *= x;x *= x;y >>= 1;} return ans;}
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while(!isdigit(c)) {if (c == '-') f = -1;c = getchar();} while(isdigit(c)) {x = x * 10 + c - '0';c = getchar();} x *= f;}
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x); read(y...); }
int gcd(int a, int b) { if (!a | !b) return a + b; int az = __builtin_ctz(a); int bz = __builtin_ctz(b); int z = min(az, bz); a >>= az, b >>= bz; while (a != b) { int diff = b - a; az = __builtin_ctz(diff); b = min(a, b), a = abs(diff) >> az; } return a << z; }
ll gcd(ll a, ll b) { if (!a | !b) return a + b; ll az = __builtin_ctzll(a); ll bz = __builtin_ctzll(b); ll z = min(az, bz); a >>= az, b >>= bz; while (a != b) { ll diff = b - a; az = __builtin_ctzll(diff); b = min(a, b), a = abs(diff) >> az; } return a << z; }
// clang-format on

// File head end

namespace {
constexpr ll MAXN = 1e6 + 5, INF = 1e9 + 5;
struct Node {
  int l, r, tag;
  pii minv;
  Node() : l(0), r(0), tag(0), minv(INF, INF) {}
} T[MAXN << 2];
#define lc(p) ((p) << 1)
#define rc(p) ((p) << 1 | 1)
[[gnu::always_inline]] il void _add(pii &x, int y) { x.fi += y, x.se += y; }
[[gnu::always_inline]] il pii _cmp(pii x, pii y) {
  return {min(x.fi, y.fi), min(x.se, y.se)};
}
[[gnu::always_inline]] il int _sel(pii x, int dim) {
  return (dim) ? x.se : x.fi;
}
il void pu(int p) { T[p].minv = _cmp(T[lc(p)].minv, T[rc(p)].minv); }
il void f(int p, int v) { _add(T[p].minv, v), T[p].tag += v; }
il void pd(int p) {
  f(lc(p), T[p].tag), f(rc(p), T[p].tag);
  T[p].tag = 0;
}
void build(int p, int l, int r) {
  T[p].l = l, T[p].r = r;
  if (l == r)
    return;
  int mid = (l + r) >> 1;
  build(lc(p), l, mid), build(rc(p), mid + 1, r);
  pu(p);
}
void add(int p, int ql, int val) {
  int l = T[p].l, r = T[p].r;
  if (ql <= T[p].l)
    return f(p, val);
  int mid = (l + r) >> 1;
  pd(p);
  if (ql <= mid)
    add(lc(p), ql, val);
  add(rc(p), ql, val);
  pu(p);
}
void upd(int p, int pos, pii v) {
  int l = T[p].l, r = T[p].r;
  if (l == r) {
    if (v.fi != -1)
      T[p].minv.fi = v.fi;
    if (v.se != -1)
      T[p].minv.se = v.se;
    return;
  }
  int mid = (l + r) >> 1;
  pd(p);
  if (pos <= mid)
    upd(lc(p), pos, v);
  else
    upd(rc(p), pos, v);
  pu(p);
}
int qry(int p, int dim) {
  if (T[p].l == T[p].r)
    return assert(_sel(T[p].minv, dim) <= 0), T[p].l;
  pd(p);
  if (_sel(T[lc(p)].minv, dim) <= 0)
    return qry(lc(p), dim);
  if (_sel(T[rc(p)].minv, dim) <= 0)
    return qry(rc(p), dim);
  return T[p].r + 1;
}
pii qmin(int p, int ql, int qr) {
  int l = T[p].l, r = T[p].r;
  if (ql <= l && qr >= r)
    return T[p].minv;
  pd(p);
  int mid = (l + r) >> 1;
  pii ans{INF, INF};
  if (ql <= mid)
    ans = _cmp(ans, qmin(lc(p), ql, qr));
  if (qr > mid)
    ans = _cmp(ans, qmin(rc(p), ql, qr));
  return ans;
}
int qry2(int ql, int dim) {
  int l = ql, r = T[1].r;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (_sel(qmin(1, mid, T[1].r), dim) <= 0)
      r = mid - 1;
    else
      l = mid + 1;
  }
  return r + 1;
}
int n, q, Ans[MAXN], bit[MAXN];
pii a[MAXN];
vector<pii> Qry[MAXN];
#define lbt(x) (x & -x)
il void bit_add(int p, int v) {
  for (; p <= n; p += lbt(p))
    bit[p] += v;
}
il int bit_sum(int p) {
  int ans = 0;
  for (; p; p -= lbt(p))
    ans += bit[p];
  return ans;
}
il void change(int x, int dlt) {
  while (1) {
    bit_add(x, dlt);
    if (dlt == 1) {
      upd(1, x, mkp(INF, -1));
      (x < n) && (add(1, x + 1, -1), 1);
    } else {
      upd(1, x, mkp(INF, INF));
      (x < n) && (add(1, x + 1, 1), 1);
    }
    int v1 = qry2(x + 1, 0), v2 = qry2(x + 1, 1);
    while (v1 == v2 && v1 <= n) {
      upd(1, v1, mkp(INF, INF));
      v1 = qry2(v1 + 1, 0), v2 = qry2(v2 + 1, 1);
      // cerr << v1 << ' ' << v2 << '\n';
    }
    // cerr << v1 << ' ' << v2 << '\n';
    assert(v1 > x);
    if (v1 < v2)
      x = v1, dlt = 1;
    else if (v1 > v2)
      x = v2, dlt = -1;
    else {
      assert(v1 == n + 1);
      break;
    }
  }
}
il void Main() {
  read(n, q);
  For(i, 1, n) read(a[i].fi, a[i].se);
  For(i, 1, q) {
    int l, r;
    read(l, r), Qry[l].eb(r, i);
  }
  build(1, 1, n);
  ForDown(i, n, 1) {
    // cerr << "----" << i << "----\n";
    upd(1, i, mkp(a[i].fi, a[i].se + 1));
    if (!a[i].fi)
      change(i, 1);
    for (auto [j, k] : Qry[i])
      Ans[k] = bit_sum(j);
  }
  For(i, 1, q) cout << Ans[i] << '\n';
}
} // namespace

signed main() { return Main(), 0; }