#include <bits/stdc++.h>
using namespace std;
const long long maxn = 300010;
const long long MOD = 1e9 + 7;
const long long MOD2 = 998244353;
const long long INF = 1e9;
const long long LINF = 1e18;
long long n, m, x, y, l, r, k, q, a[maxn], b[maxn];
map<long long, long long> M, N;
string s, ss;
set<long long> S;
void solve() {
  cin >> n >> k >> q;
  fill(a, a + maxn, 0ll), fill(b, b + maxn, 0ll);
  for (long long i = 0; i < n; i++) {
    cin >> x >> y;
    a[x]++;
    a[y + 1]--;
  }
  for (long long i = 0; i <= 200000; i++) a[i + 1] += a[i];
  for (long long i = 0; i <= 200001; i++) b[i] = (a[i] >= k);
  for (long long i = 0; i <= 200000; i++) b[i + 1] += b[i];
  while (q--) {
    cin >> x >> y;
    cout << b[y] - b[x - 1] << "\n";
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long t = 1;
  while (t--) solve();
}
