#include <bits/stdc++.h>   using namespace std;   const int high = 2e5 + 6;   long long cnt[200005], dif[200005];   int main() {     long long n, m, k, i, j, ans, l, r, d, sum = 0, q;     scanf( %lld%lld%lld , &n, &k, &q);     for (i = 0; i < n; i++) {       scanf( %lld%lld , &l, &r);       dif[l]++;       dif[r + 1]--;     }     for (i = 1; i <= high; i++) {       dif[i] += dif[i - 1];     }     for (i = 1; i <= high; i++) {       if (dif[i] >= k) {         cnt[i] = 1;       }     }     for (i = 1; i <= high; i++) {       cnt[i] += cnt[i - 1];     }     while (q--) {       scanf( %lld%lld , &l, &r);       printf( %lld n , cnt[r] - cnt[l - 1]);     }   }   