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