#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int a[maxn], b[maxn];
int main() {
  int n, k, q;
  cin >> n >> k >> q;
  for (int i = 0; i < n; i++) {
    int l, r;
    cin >> l >> r;
    a[l]++;
    a[r + 1]--;
  }
  for (int i = 1; i <= maxn; i++) a[i] += a[i - 1];
  for (int i = 1; i <= maxn; i++)
    if (a[i] >= k) b[i]++;
  for (int i = 1; i <= maxn; i++) b[i] += b[i - 1];
  for (int i = 0; i < q; i++) {
    int x, y;
    cin >> x >> y;
    cout << b[y] - b[x - 1] << "\n";
  }
  return 0;
}
