#include <bits/stdc++.h>
using namespace std;
int n, k, q, arr[200005], brr[200005];
int main(int argc, char const *argv[]) {
  cin >> n >> k >> q;
  memset(arr, 0, sizeof(arr));
  ;
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    arr[a]++;
    arr[b + 1]--;
  }
  for (int i = 1; i <= 200000; i++) {
    arr[i] += arr[i - 1];
    brr[i] += brr[i - 1] + (arr[i] >= k);
  }
  while (q--) {
    int a, b;
    cin >> a >> b;
    printf("%d\n", brr[b] - brr[a - 1]);
  }
  return 0;
}
