#include <bits/stdc++.h>
using namespace std;
int ar[1000 * 100 * 2 + 50];
int arr[1000 * 100 * 2 + 50];
int p = 1000 * 100 * 2 + 30;
int n, k, q;
void solve() {
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    ar[x]++;
    ar[y + 1]--;
  }
  for (int i = 1; i <= p; i++) {
    ar[i] = ar[i] + ar[i - 1];
    if (ar[i] >= k) {
      arr[i] = arr[i - 1] + 1;
    } else {
      arr[i] = arr[i - 1];
    }
  }
}
int main() {
  solve();
  while (q--) {
    int x, y;
    cin >> x >> y;
    cout << arr[y] - arr[x - 1] << endl;
  }
}
