#include <bits/stdc++.h>
using namespace std;
const int maxn = 200002;
int c[maxn], sum[maxn];
int n;
int lowbit(int t) { return t & (-t); }
void insert(int t, int d) {
  while (t <= maxn) {
    c[t] += d;
    t += lowbit(t);
  }
}
int getSum(int t) {
  int sum = 0;
  while (t > 0) {
    sum += c[t];
    t -= lowbit(t);
  }
  return sum;
}
int main() {
  int n, k, q;
  scanf("%d%d%d", &n, &k, &q);
  int a, b;
  memset(c, 0, sizeof(c));
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &a, &b);
    insert(a, 1);
    insert(b + 1, -1);
  }
  memset(sum, 0, sizeof(sum));
  for (int j = 0; j < maxn; j++) {
    if (getSum(j) >= k) sum[j]++;
  }
  for (int i = 1; i < maxn; i++) sum[i] += sum[i - 1];
  for (int i = 1; i <= q; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    printf("%d\n", sum[y] - sum[x - 1]);
  }
  return 0;
}
