#include <bits/stdc++.h>
using namespace std;
const int N = 1234567;
const int mod = 1e9 + 7;
int dp[N], sum[N];
int main() {
  int n, k, q, a, b;
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    cin >> a >> b;
    dp[a] += 1;
    dp[b + 1] -= 1;
  }
  for (int i = 1; i < N; i++) {
    dp[i] += dp[i - 1];
  }
  for (int i = 0; i < N; i++) {
    if (dp[i] >= k)
      dp[i] = 1;
    else
      dp[i] = 0;
  }
  for (int i = 1; i < N; i++) sum[i] = sum[i - 1] + dp[i];
  for (int i = 0; i < q; i++) {
    cin >> a >> b;
    cout << sum[b] - sum[a - 1] << endl;
  }
  return 0;
}
