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