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