#include <bits/stdc++.h>
using namespace std;
int t[262144 * 2 + 1];
int ans[262144 + 5];
int n, k, q;
int N = 262144;
void insert(int a, int b) {
  a += N;
  b += N;
  while (a <= b) {
    if (a % 2 == 1) t[a++] += 1;
    if (b % 2 == 0) t[b--] += 1;
    a /= 2;
    b /= 2;
  }
  return;
}
void count(int indice, int val) {
  val += t[indice];
  if (indice >= N) {
    if (val >= k) ans[indice - N + 1] = 1;
    return;
  }
  count(indice * 2, val);
  count(indice * 2 + 1, val);
}
int main() {
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    insert(a - 1, b - 1);
  }
  count(1, 0);
  for (int i = 1; i < 262144 + 1; i++) ans[i] += ans[i - 1];
  while (q--) {
    int a, b;
    cin >> a >> b;
    cout << ans[b] - ans[a - 1] << endl;
  }
}
