#include <bits/stdc++.h>
long long int MOD = 1000000007;
using namespace std;
vector<long long int> dp;
int main() {
  long long int t;
  t = 1;
  while (t--) {
    long long int n, k, q, l, r;
    cin >> n >> k >> q;
    vector<long long int> els(200000, 0), sums;
    for (long long int i = 0; i < n; i++) {
      cin >> l >> r;
      l--;
      r--;
      if (l != 0) els[l - 1] -= 1;
      els[r] += 1;
    }
    for (int i = els.size() - 2; i >= 0; i--) {
      els[i] += els[i + 1];
    }
    for (long long int i = 0; i < els.size(); i++) {
      if (els[i] >= k)
        els[i] = 1;
      else
        els[i] = 0;
    }
    long long int sum = 0;
    for (long long int i = 0; i < els.size(); i++) {
      sum += els[i];
      sums.push_back(sum);
    }
    for (long long int i = 0; i < q; i++) {
      cin >> l >> r;
      l--;
      r--;
      if (l != 0)
        cout << sums[r] - sums[l - 1] << endl;
      else
        cout << sums[r] << endl;
    }
  }
}
