#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10;

int l[N], r[N], a[N];

struct Q
{
	int l, r, ans, id;
}qry[N];

namespace tr
{
	int n, mn[N << 2], mx[N << 2], tadd[N << 2];

	void pushup(int i)
	{
		mn[i] = min(mn[i << 1], mn[i << 1 | 1]), mx[i] = max(mx[i << 1], mx[i << 1 | 1]);
	}
	
	void apply(int i, int dadd)
	{
		mn[i] += dadd, mx[i] += dadd, tadd[i] += dadd;
	}
	
	void pushdown(int i)
	{
		if (!tadd[i]) return;
		apply(i << 1, tadd[i]), apply(i << 1 | 1, tadd[i]);
		tadd[i] = 0;
	}

	void build(int *a, int i = 1, int li = 1, int ri = n)
	{
		if (li == ri)
		{
			mn[i] = mx[i] = a[li];
			return;
		}
		int mid = (li + ri) >> 1;
		build(a, i << 1, li, mid), build(a, i << 1 | 1, mid + 1, ri);
		pushup(i);
	}
	
	void init(int sz)
	{
		n = sz;
	}
	
	void add(int l, int r, int i = 1, int li = 1, int ri = n)
	{
		if (l <= li && ri <= r) return apply(i, 1);
		pushdown(i);
		int mid = (li + ri) >> 1;
		if (l <= mid) add(l, r, i << 1, li, mid);
		if (r > mid) add(l, r, i << 1 | 1, mid + 1, ri);
		pushup(i);
	}
	
	int qfirst(int v, int i = 1, int li = 1, int ri = n)
	{
		// first <= v
		if (li == ri) return mx[i] <= v ? li : n + 1;
		pushdown(i);
		int mid = (li + ri) >> 1;
		if (mx[i << 1] <= v) return qfirst(v, i << 1, li, mid);
		else return qfirst(v, i << 1 | 1, mid + 1, ri);
	}
	
	int qlast(int v, int i = 1, int li = 1, int ri = n)
	{
		// last >= v
		if (li == ri) return mn[i] >= v ? li : -1;
		pushdown(i);
		int mid = (li + ri) >> 1;
		if (mx[i << 1 | 1] >= v) return qlast(v, i << 1 | 1, mid + 1, ri);
		else return qlast(v, i << 1, li, mid);
	}
	
	int qval(int pos, int i = 1, int li = 1, int ri = n)
	{
		if (li == ri) return mn[i];
		pushdown(i);
		int mid = (li + ri) >> 1;
		if (pos <= mid) return qval(pos, i << 1, li, mid);
		else return qval(pos, i << 1 | 1, mid + 1, ri);
	}
}

signed main()
{
	int n, q; cin >> n >> q;
	for (int i = 1; i <= n; i++) cin >> l[i] >> r[i];
	for (int i = 1; i <= q; i++) cin >> qry[i].l >> qry[i].r, qry[i].id = i;
	tr::init(n);
	sort(qry + 1, qry + 1 + q, [](Q q1, Q q2) { return q1.r < q2.r; });
	for (int i = 1, id = 1; i <= n; i++)
	{
		int lp = tr::qfirst(r[i]), rp = min(i, tr::qlast(l[i]));
		if (lp <= rp) tr::add(lp, rp);
		while (id <= q && qry[id].r == i)
		{
			qry[id].ans = tr::qval(qry[id].l);
			id++;
		}
	}
	sort(qry + 1, qry + 1 + q, [](Q q1, Q q2) { return q1.id < q2.id; });
	for (int i = 1; i <= q; i++) cout << qry[i].ans << '\n';
}