#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 3;
vector<int> a, b;
int c[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t, i, j, n, m, l, r, q;
  cin >> n >> m >> q;
  for (i = 0; i < n; i++) {
    cin >> l >> r;
    a.push_back(l);
    b.push_back(r);
  }
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  for (i = 1; i < N; i++) {
    l = upper_bound(a.begin(), a.end(), i) - a.begin();
    r = lower_bound(b.begin(), b.end(), i) - b.begin();
    if ((l - r) >= m) {
      c[i] = 1;
    }
  }
  for (i = 1; i < N; i++) {
    c[i] += c[i - 1];
  }
  while (q--) {
    cin >> l >> r;
    cout << c[r] - c[l - 1] << "\n";
  }
  return 0;
}
