#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=200010;
int h[maxn]={0},c[maxn]={0};
int main(){
	freopen("coffee.in","r",stdin);
	freopen("coffee.out","w",stdout);
	int n,k,q,a,b,t;
	scanf("%d%d%d",&n,&k,&q);
	for(int i=1;i<=n;i++)scanf("%d%d",&a,&b),h[a]++,h[b+1]--;
	for(int i=1;i<=maxn;i++){
		h[i]=h[i-1]+h[i];
		if(h[i]<k)t=0;
		else if(h[i]>=k)t=1;
		c[i]=c[i-1]+t;
	}
	for(int i=1;i<=q;i++){
		scanf("%d%d",&a,&b);
		printf("%d\n",c[b]-c[a-1]);
	}
	return 0;
}