#include <bits/stdc++.h>
using namespace std;
const int MAX = 200001;
void help() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
int main() {
  help();
  int n, k, q;
  cin >> n >> k >> q;
  unordered_map<int, int> lim;
  for (int i = 0; i < n; i++) {
    int l, r;
    cin >> l >> r;
    lim[l]++;
    lim[r + 1]--;
  }
  int ps[MAX + 1];
  ps[0] = 0;
  for (int i = 1; i < MAX; i++) ps[i] = lim[i] + ps[i - 1];
  int ans[MAX + 1];
  for (int i = 1; i < MAX; i++) {
    if (ps[i] >= k)
      ans[i] = ans[i - 1] + 1;
    else
      ans[i] = ans[i - 1];
  }
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    cout << ans[r] - ans[l - 1] << endl;
  }
  return 0;
}
