#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, q, i, l, r, min = 200001, max = 0;
  vector<int> rcp(200010);
  cin >> n >> k >> q;
  while (n--) {
    cin >> l >> r;
    rcp[l]++;
    rcp[r + 1]--;
    if (l < min) min = l;
    if (r > max) max = r;
  }
  for (i = min; i <= rcp.size(); i++) {
    rcp[i] += rcp[i - 1];
  }
  for (i = min; i <= rcp.size(); i++) {
    if (rcp[i] >= k)
      rcp[i] = 1;
    else
      rcp[i] = 0;
  }
  for (i = min; i <= rcp.size(); i++) {
    rcp[i] += rcp[i - 1];
  }
  while (q--) {
    int c, x;
    cin >> l >> r;
    if (r > max + 1)
      x = rcp[max + 1];
    else
      x = rcp[r];
    c = x - rcp[l - 1];
    cout << c << '\n';
  }
}
