#include <bits/stdc++.h>
using namespace std;
long long int partial[211111], pre[211111];
long long int n, k, q;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> k >> q;
  long long int mn = 1e9, mx = -1e9;
  for (long long int i = 0; i < n; i++) {
    long long int l, r;
    cin >> l >> r;
    partial[l]++;
    partial[r + 1]--;
    mn = min(mn, min(l, r));
    mx = max(mx, max(l, r));
  }
  long long int sum = 0;
  for (long long int i = mn; i <= mx; i++) {
    sum += partial[i];
    partial[i] = sum;
  }
  for (long long int i = mn; i <= mx; i++) {
    pre[i] = (partial[i] >= k);
    pre[i] += pre[i - 1];
  }
  for (long long int i = 0; i < q; i++) {
    long long int l, r;
    cin >> l >> r;
    if (r >= mx && l <= mx) {
      r = mx;
    }
    cout << pre[r] - pre[l - 1] << '\n';
  }
  return 0;
}
