#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

vector<ll> p(1000005, 0);

int main() {
    ll n, k;
    cin >> n >> k;

    ll mx = 0;

    for(ll i = 1; i <= n; i++) {
        ll l, r;
        cin >> l >> r;

        mx = max(mx, r);

        p[l]++;
        p[r + 1]--;
    }

    for(ll i = 1; i <= mx + 1; i++)
        p[i] += p[i - 1];

    for(ll i = 1; i <= mx + 1; i++)
        p[i] = (p[i] >= k);

    for(ll i = 1; i <= mx + 1; i++)
        p[i] += p[i - 1];

    ll q;
    cin >> q;

    while(q--) {
        ll x, y;
        cin >> x >> y;

        cout << p[y] - p[x - 1] << '\n';
    }

    return 0;
}