#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
bool isprime(long long int a) {
  if (a == 1) return false;
  if (a == 2) return true;
  if (a % 2 == 0) return false;
  for (long long int i = 3; (i * i) <= a; i += 2) {
    if (a % i == 0) return false;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    int n, k, q;
    cin >> n >> k >> q;
    int pre[200055] = {0};
    for (int i = 0; i < n; i++) {
      int x, y;
      cin >> x >> y;
      pre[x - 1]++;
      pre[y]--;
    }
    int sum = pre[0];
    for (int i = 1; i <= 200054; i++) {
      int temp = pre[i];
      pre[i] = sum;
      sum += temp;
    }
    int prefixcnt[200055] = {0};
    prefixcnt[0] = 0;
    int temp = 0;
    for (int i = 1; i <= 200054; i++) {
      if (pre[i] >= k) {
        temp += 1;
      }
      prefixcnt[i] = temp;
    }
    for (int i = 1; i <= q; i++) {
      int a, b;
      cin >> a >> b;
      cout << prefixcnt[b] - prefixcnt[a - 1] << "\n";
    }
  }
  return 0;
}
