//私は猫です
#include <bits/stdc++.h>
using namespace std;
// #define int long long
int read(){
    int xx = 0, f = 1; char ch = getchar();
    for (;!isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (; isdigit(ch); ch = getchar())
        xx = (xx << 3) + (xx << 1) + ch - '0';
    return xx * f;
}
const int N = 1000100, inf = 1e9 + 7;
struct sqtr{
    int ans[N << 2], ll[N << 2], rr[N << 2], sub[N << 2];
    bool fl;
    void up(int x){
        ll[x] = min(ll[x << 1], ll[x << 1 | 1]),
        rr[x] = min(rr[x << 1], rr[x << 1 | 1]);
    }
    void dec(int x, int val){
        ll[x] -= val, rr[x] -= val, sub[x] += val;
    }
    void dw(int x){
        if (ans[x] != 0)
            ans[x << 1] += ans[x], ans[x << 1 | 1] += ans[x],
            ans[x] = 0;
        if (sub[x] != 0)
            dec(x << 1, sub[x]), dec(x << 1 | 1, sub[x]),
            sub[x] = 0;
    }
    void upd(int x, int l, int r, int nl, int val, int var){
        if (l == r){
            ll[x] = val, rr[x] = var, ans[x] = 0; return ;
        }
        int mid = (l + r) >> 1; dw(x);
        if (nl <= mid)upd(x << 1, l, mid, nl, val, var);
        else upd(x << 1 | 1, mid + 1, r, nl, val, var);
        up(x);
    }
    void work(int x, int l, int r, int &val){
        if (ll[x] - val > 0 && rr[x] - val >= 0){
            dec(x, val), ans[x] += val; return ;
        }
        if (l == r){
            int ad = 0;
            if (ll[x] - val <= 0)ll[x] = inf, ++ad;
            if (rr[x] - val < 0)rr[x] = inf, --ad;
            val += ad;
            ans[x] += val;
            return ;
        }
        int mid = (l + r) >> 1; dw(x);
        work(x << 1, l, mid, val), work(x << 1 | 1, mid + 1, r, val);
        up(x);
    }
    void mdy(int x, int l, int r, int nl, int &val){
        if (nl > r)return ;
        if (nl <= l){
            work(x, l, r, val);
            if (val == 0)fl = true;
            return ;
        }
        int mid = (l + r) >> 1;
        if (nl <= mid){
            mdy(x << 1, l, mid, nl, val);
            if (!fl)mdy(x << 1 | 1, mid + 1, r, nl, val);
        }
        else mdy(x << 1 | 1, mid + 1, r, nl, val);
    }
    void add(int x, int l, int r, int nl, int nr){
        if (nl > nr)return ;
        if (nl <= l && r <= nr){++ans[x]; return ;}
        int mid = (l + r) >> 1; dw(x);
        if (nl <= mid)add(x << 1, l, mid, nl, nr);
        if (nr > mid)add(x << 1 | 1, mid + 1, r, nl, nr);
    }
    int query(int x, int l, int r, int nl){
        if (l == r){return ans[x];}
        int mid = (l + r) >> 1; dw(x);
        if (nl <= mid)return query(x << 1, l, mid, nl);
        else return query(x << 1 | 1, mid + 1, r, nl);
    }
    void out(int x, int l, int r){
        if (l == r){cout<<ans[x]<<" "; return ;}
        int mid = (l + r) >> 1; dw(x);
        out(x << 1, l, mid), out(x << 1 | 1, mid + 1, r);
    }
    void build(int x, int l, int r){
        ans[x] = 0;
        if (l == r)return ;
        int mid = (l + r) >> 1;
        build(x << 1, l, mid), build(x << 1 | 1, mid + 1, r);
    }
}A;
int n, q, l[N], r[N], ans[N];
struct Q{
    int l, r, id;
}qu[N];
bool cmp(Q x, Q y){return x.l > y.l;}
signed main(){
    n = read(), q = read();
    for (int i = 1; i <= n; ++i)l[i] = read(), r[i] = read();
    for (int i = 1, x, y; i <= q; ++i)x = read(), y = read(), qu[i] = Q{x, y, i};
    sort(qu + 1, qu + q + 1, cmp);
    A.build(1, 1, n);
    for (int i = n, j = 1, va; i >= 1; --i){
        A.upd(1, 1, n, i, l[i], r[i]);
        A.fl = false, va = 0, A.mdy(1, 1, n, i, va);
        // A.out(1, 1, n); printf("\n");
        while(j <= q && qu[j].l == i)ans[qu[j].id] = A.query(1, 1, n, qu[j].r), ++j;
    }
    for (int i = 1; i <= q; ++i)printf("%d\n", ans[i]);
    return 0;
}