#include <bits/stdc++.h>
using namespace std;
int c[200010], f[200010], x[200010], n, k, q;
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 0; i < n; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    c[l]++;
    c[r + 1]--;
  }
  for (int i = 0; i <= 200000; i++) x[i] = x[i - 1] + c[i];
  for (int i = 0; i <= 200000; i++) f[i] = f[i - 1] + (x[i] >= k);
  for (int i = 0; i < q; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    printf("%d\n", f[r] - f[l - 1]);
  }
  return 0;
}
