#include <iostream>
#include <cstdio>
using namespace std;
const int maxn=200000+10;
int p[maxn],d[maxn]={0};
int main(){
	freopen("coffee.in","r",stdin);
	freopen("coffee.out","w",stdout);
	int n,k,q;
	scanf("%d %d %d",&n,&k,&q);
	int x,y;
	for(int i=1;i<=n;i++){
		scanf("%d %d",&x,&y);
		p[x]++,p[y+1]--;
	}
	for(int i=1;i<=200000;i++){
		d[i]=d[i-1];
		p[i]+=p[i-1];
		if(p[i]>=k)
			d[i]++;
	}
	for(int i=1;i<=q;i++){
		scanf("%d %d",&x,&y);
		printf("%d\n",d[y]-d[x-1]);
	}
return 0;
}