#include <bits/stdc++.h>
const int N = 2e5 + 10;
int arr[N], arr2[N];
int main(int argc, char const *argv[]) {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 0; i < n; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    arr[l] += 1;
    arr[r + 1] -= 1;
  }
  for (int i = 1; i < N; i++) {
    arr[i] += arr[i - 1];
    arr2[i] = arr2[i - 1] + (arr[i] >= k ? 1 : 0);
  }
  for (int i = 0; i < q; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    printf("%d\n", arr2[r] - arr2[l - 1]);
  }
  return 0;
}
