#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int n, k, q;
int pref[200005];
int main() {
  cin >> n >> k >> q;
  int maxRight = 0;
  for (int i = 0; i < n; ++i) {
    int left, right;
    cin >> left >> right;
    maxRight = max(maxRight, right);
    ++pref[left], --pref[right + 1];
  }
  for (int i = 1; i <= maxRight; ++i) {
    pref[i] += pref[i - 1];
  }
  for (int i = 0; i <= 200001; ++i) {
    pref[i] = (int)(pref[i] >= k);
    pref[i] += pref[i - 1];
  }
  while (q--) {
    int a, b;
    cin >> a >> b;
    cout << pref[b] - pref[a - 1] << endl;
  }
  return 0;
}
