#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
const double pi = 3.141592654;
const int N = 200000;
int n, m, q, x, y, a[N + 10], s[N + 10];
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &x, &y), ++a[x], --a[y + 1];
  for (int i = 1; i <= N; ++i) a[i] += a[i - 1], s[i] = s[i - 1] + (a[i] >= m);
  for (int i = 1; i <= q; ++i)
    scanf("%d%d", &x, &y), printf("%d\n", s[y] - s[x - 1]);
  return 0;
}
