#include <bits/stdc++.h>
using namespace std;
long long n, k, q, a[200005], f[200005];
int main() {
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) {
    long long l, r;
    cin >> l >> r;
    a[l]++;
    a[r + 1]--;
  }
  for (int i = 1; i <= 200000; i++) a[i] += a[i - 1];
  for (int i = 1; i <= 200000; i++) {
    f[i] += f[i - 1];
    if (a[i] >= k) {
      f[i]++;
    }
  }
  for (int i = 1; i <= q; i++) {
    long long l, r;
    cin >> l >> r;
    cout << f[r] - f[l - 1] << endl;
  }
}
