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