#include <bits/stdc++.h>
using namespace std;
const int SIZE = 2e5 + 10;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const double PI = atan(1.0) * 4.0;
const long long mod = 1e9 + 7;
int n, k, q, x, y;
int a[SIZE], res[SIZE];
int main() {
  scanf("%d%d%d", &n, &k, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &x, &y);
    a[x]++, a[y + 1]--;
  }
  for (int i = 1; i < SIZE; i++) {
    a[i] += a[i - 1];
    res[i] += res[i - 1];
    if (a[i] >= k) res[i]++;
  }
  while (q--) {
    scanf("%d%d", &x, &y);
    int ans = res[y] - res[x - 1];
    printf("%d\n", ans);
  }
  return 0;
}
