#include <bits/stdc++.h>
using namespace std;
string s;
vector<long long> prim;
set<long long> prim2;
void primeFactors(int n) {
  while (n % 2 == 0) {
    prim.push_back(2);
    prim2.insert(2);
    n = n / 2;
  }
  for (int i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      prim.push_back(i);
      prim2.insert(i);
      n = n / i;
    }
  }
  if (n > 2) {
    prim.push_back(n);
    prim2.insert(n);
  }
}
long long dp[10005][27];
long long arr[3000000];
void func() {
  long long n, k, q;
  cin >> n >> k >> q;
  long long a, b;
  long long lo = INT_MAX, hi = INT_MIN;
  while (n--) {
    cin >> a >> b;
    lo = min(lo, a);
    hi = max(hi, b);
    arr[a] += 1;
    arr[b + 1] -= 1;
  }
  for (int i = max(lo - 10, (long long)1); i <= hi + 10; i++) {
    arr[i] += arr[i - 1];
  }
  for (int i = 1; i <= 200000; i++) {
    if (arr[i] >= k) {
      arr[i] = 1;
    } else {
      arr[i] = 0;
    }
    arr[i] += arr[i - 1];
  }
  while (q--) {
    cin >> a >> b;
    cout << arr[b] - arr[a - 1] << "\n";
  }
}
int main() {
  {
    ios ::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
  }
  { func(); }
  return 0;
}
