#include <bits/stdc++.h>
using namespace std;
struct Val {
  int l;
  int r;
  int id;
  int sort;
  bool type;
  bool operator<(const Val& s) const {
    if (sort == s.sort) {
      if (type == s.type) {
        return id < s.id;
      }
      return type < s.type;
    }
    return sort < s.sort;
  }
};
int main() {
  int n;
  int k, q;
  cin >> n >> k >> q;
  vector<Val> arr;
  arr.reserve(2 * n);
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    Val v;
    v.l = a;
    v.r = b;
    v.sort = v.l;
    v.type = 0;
    v.id = i;
    arr.push_back(v);
    v.sort = v.r;
    v.type = 1;
    arr.push_back(v);
  }
  sort(arr.begin(), arr.end());
  vector<int> good(200002);
  int lg = 0;
  int rg = 0;
  int d = 0;
  for (int i = 0; i < 2 * n; i++) {
    Val v = arr[i];
    if (!v.type) {
      d++;
      if (d == k) {
        lg = v.l;
      }
    } else {
      d--;
      if (d == k - 1) {
        rg = v.r;
        for (int i = lg; i < rg + 1; i++) {
          good[i] = 1;
        }
      }
    }
  }
  vector<int> sums(200002);
  for (int i = 1; i < 200002; i++) {
    sums[i] = sums[i - 1] + good[i];
  }
  for (int i = 0; i < q; i++) {
    int a, b;
    cin >> a >> b;
    cout << sums[b] - sums[a - 1] << endl;
  }
  return 0;
}
