CF419 div2B. 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 leastk 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 betweena andb, 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), andq (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, thei-th line among these contains two integersl_i andr_i (1 ≤ l_i ≤ r_i ≤ 200000), describing that thei-th recipe suggests that the coffee be brewed betweenl_i andr_i degrees, inclusive.

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

Output

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

Examples

Input

3 2 491 9492 9797 9992 9493 9795 9690 100

Output

3304

Input

2 1 11 1200000 20000090 100

Output

0思路:运用递推的方式依次从每个区间的起点往后加1，这样就可以在n的复杂度内枚举出数字的出现次数，注意区间结束应该-1，标志区间结束。按照递推的关系，每个数的出现次数都要加上前一个数的出现次数，当区间结束，应当减去1.当递推的同时再用一个c数组也从开始递推，同样是加上前一个，但是同时也要判断此刻的数是否大于k如果大于，就再加一，这样就可以确定在一定范围内的数大于k的个数。