#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64000000")
using namespace std;
const int inf = (int)1e9 + 10;
const int mod = (int)1e9 + 7;
const double eps = 1e-7;
const double pi = 3.14159265359;
const int maxLen = (int)2e5 + 1;
int t[4 * maxLen];
int N;
void add(int v, int tl, int tr, int l, int r) {
  if (l > r) return;
  if (tl == l && r == tr)
    t[v]++;
  else {
    int m = (tl + tr) / 2;
    add(2 * v, tl, m, l, min(m, r));
    add(2 * v + 1, m + 1, tr, max(m + 1, l), r);
  }
}
void getN(int n) {
  N = 1;
  while (N <= n) N <<= 1;
}
int query(int i) {
  int v = i + N;
  int ans = 0;
  while (v > 0) {
    ans += t[v];
    v >>= 1;
  }
  return ans;
}
int main() {
  for (int i = 0; i < 4 * maxLen + 1; i++) t[i] = 0;
  int n, k, q;
  scanf("%d %d %d", &n, &k, &q);
  getN(200000);
  for (int i = 0; i < n; i++) {
    int l, r;
    scanf("%d %d", &l, &r);
    add(1, 0, N - 1, l - 1, r - 1);
  }
  int A[maxLen * 2 + 1] = {};
  A[0] = query(0) >= k;
  for (int i = 1; i < 200000; i++) A[i] = A[i - 1] + (query(i) >= k);
  for (int i = 0; i < q; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    a--;
    b--;
    if (a == 0)
      printf("%d\n", A[b]);
    else
      printf("%d\n", A[b] - A[a - 1]);
  }
  return 0;
}
