#include <bits/stdc++.h>
using namespace std;
int a[200005], b[200005];
void Karenand_Coffee() {
  int n, k, q, l, r;
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    cin >> l >> r, a[l]++, a[r + 1]--;
  }
  for (int i = 1; i < 200001; i++)
    a[i] += a[i - 1], b[i] = b[i - 1] + (a[i] >= k);
  while (q--) {
    cin >> l >> r;
    cout << b[r] - b[l - 1] << endl;
  }
}
int main() {
  Karenand_Coffee();
  return 0;
}
