#include <bits/stdc++.h>   using namespace std;   const int MAX = 200005;   int main() {     int n, k, q, i, a, b, p[MAX] = {0}, c[MAX] = {0};     scanf( %d %d %d , &n, &k, &q);     while (n--) {       scanf( %d %d , &a, &b);       p[a]++;       p[b + 1]--;     }     for (i = 1; i < MAX; i++) {       p[i] += p[i - 1];       c[i] += c[i - 1] + (p[i] >= k);     }     while (q--) {       scanf( %d %d , &a, &b);       printf( %d n , c[b] - c[a - 1]);     }     return 0;   }   