#include <bits/stdc++.h>
using namespace std;
const int nMax = 200003;
int smen[nMax];
int main() {
  cin.sync_with_stdio(false);
  cin.tie(NULL);
  int n, k, q, st, dr;
  cin >> n >> k >> q;
  int m = nMax - 3;
  for (int i = 1; i <= n; i++) {
    cin >> st >> dr;
    smen[st]++;
    smen[dr + 1]--;
  }
  for (int i = 1; i <= m; i++) {
    smen[i] = smen[i - 1] + smen[i];
  }
  for (int i = 1; i <= m; i++) {
    if (smen[i] >= k) {
      smen[i] = 1;
    } else {
      smen[i] = 0;
    }
  }
  for (int i = 1; i <= m; i++) {
    smen[i] = smen[i - 1] + smen[i];
  }
  int x, y;
  for (int i = 1; i <= q; i++) {
    cin >> x >> y;
    cout << smen[y] - smen[x - 1] << "\n";
  }
  return 0;
}
