#include <bits/stdc++.h>
template <class T>
void scan(T &x) {
  static char ch;
  x = 0;
  for (ch = getchar(); ~ch && (ch < '0' || ch > '9'); ch = getchar())
    ;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
}
namespace BIT {
int sum[200005];
void Add(int a, int x) {
  for (int i = a; i <= 200000; i += ((i) & -(i))) sum[i] += x;
}
int Query(int a) {
  int res = 0;
  for (int i = a; i > 0; i -= ((i) & -(i))) res += sum[i];
  return res;
}
}  // namespace BIT
namespace BIT2 {
int sum[200005];
void Add(int a) {
  for (int i = a; i <= 200000; i += ((i) & -(i))) ++sum[i];
}
int Query(int a) {
  int res = 0;
  for (int i = a; i > 0; i -= ((i) & -(i))) res += sum[i];
  return res;
}
}  // namespace BIT2
int n, m, k;
int main() {
  scan(n);
  scan(k);
  scan(m);
  int a, b;
  for (int i = 1; i <= n; ++i) {
    scan(a);
    scan(b);
    BIT::Add(a, 1);
    BIT::Add(b + 1, -1);
  }
  for (int i = 1; i <= 200000; ++i)
    if (BIT::Query(i) >= k) BIT2::Add(i);
  for (int i = 1; i <= m; ++i) {
    scan(a);
    scan(b);
    printf("%d\n", BIT2::Query(b) - BIT2::Query(a - 1));
  }
  return 0;
}
