Karen and Coffee（前缀和，大量查询）

B. Karen and Coffee

time limit per test

2.5 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

To stay woke and attentive during classes, Karen needs some coffee!

Karen, a coffee aficionado, wants to know the optimal temperature for brewing the perfect cup of coffee. Indeed, she has spent some time reading several recipe books, including the universally acclaimed "The Art of the Covfefe".

She knows n coffee recipes. The i-th recipe suggests that coffee should be brewed between l_i and r_i degrees, inclusive, to achieve the optimal taste.

Karen thinks that a temperature is admissible if at least k recipes recommend it.

Karen has a rather fickle mind, and so she asks q questions. In each question, given that she only wants to prepare coffee with a temperature between a and b, inclusive, can you tell her how many admissible integer temperatures fall within the range?

Input

The first line of input contains three integers, n, k (1 ≤ k ≤ n ≤ 200000), and q (1 ≤ q ≤ 200000), the number of recipes, the minimum number of recipes a certain temperature must be recommended by to be admissible, and the number of questions Karen has, respectively.

The next n lines describe the recipes. Specifically, the i-th line among these contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ 200000), describing that the i-th recipe suggests that the coffee be brewed between l_i and r_i degrees, inclusive.

The next q lines describe the questions. Each of these lines contains a and b, (1 ≤ a ≤ b ≤ 200000), describing that she wants to know the number of admissible integer temperatures between a and b degrees, inclusive.

Output

For each question, output a single integer on a line by itself, the number of admissible integer temperatures between a and b degrees, inclusive.

Examples

Input

3 2 4
91 94
92 97
97 99
92 94
93 97
95 96
90 100

Output

3
3
0
4

Input

2 1 1
1 1
200000 200000
90 100

Output

0

思路 ： 1.创建被查询的数组，3个for循环实现前缀数组，使s[y] - s[x] 表示 x 到 y 满足的个数.
       2.读入数据时左端点L S[L] ++ 从L后累加结果加 1 ，右端点 R ，S[R+1] --;
       3.第一个循环后S[i]表示i处被包含的次数，第二个循环S[i] 表示i处是否满足条件 ，第三个循环S[i] 后实现 1中的作用。

#include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
#include <bitset>
#include <queue>
using namespace std;

int s[1000050]; // 记录状态

int  main()
{
int  n,k,q,i,x,y;
     
     
     scanf("%d%d%d",&n,&k,&q);
     for (i=1;i<=n;i++)
     {
         scanf("%d%d",&x,&y);
         s[x]++;
         s[y+1]--;
     }
     for (i=1;i<=200000;i++) s[i]+=s[i-1];// 重叠次数
     for (i=1;i<=200000;i++) s[i]=(s[i]>=k);// 是否满足，满足为 1
     for (i=1;i<=200000;i++) s[i]+=s[i-1];// 前缀和数组
     for (i=1;i<=q;i++)
     {
         scanf("%d%d",&x,&y);
         printf("%d\n",s[y]-s[x-1]);
     }
     
     return 0;
}