#include <bits/stdc++.h>
using namespace std;
short bitcount(long long x) {
  short z = 0;
  while (x) {
    x >>= 1;
    z++;
  }
  return z;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k, q, a, b;
  cin >> n >> k >> q;
  vector<int> v(n), V(n);
  for (int i = 0; i < n; i++) cin >> v[i] >> V[i];
  sort(v.begin(), v.end());
  sort(V.begin(), V.end());
  int i = 0, j = 0, N = 0;
  vector<int> S(200001);
  S[0] = 0;
  for (int I = 1; I < 200001; I++) {
    while (i < v.size() && v[i] == I) {
      N++;
      i++;
    }
    S[I] = S[I - 1];
    if (N >= k) {
      S[I]++;
    }
    while (j < V.size() && V[j] == I) {
      N--;
      j++;
    }
  }
  while (q--) {
    cin >> a >> b;
    cout << S[b] - S[a - 1] << '\n';
  }
}
