To stay woke and attentive during classes, Karen needs some coffee!
<center></center>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.
[samples]
## Note
In the first test case, Karen knows 3 recipes.
1. The first one recommends brewing the coffee between 91 and 94 degrees, inclusive.
2. The second one recommends brewing the coffee between 92 and 97 degrees, inclusive.
3. The third one recommends brewing the coffee between 97 and 99 degrees, inclusive.
A temperature is _admissible_ if at least 2 recipes recommend it.
She asks 4 questions.
In her first question, she wants to know the number of admissible integer temperatures between 92 and 94 degrees, inclusive. There are 3: 92, 93 and 94 degrees are all admissible.
In her second question, she wants to know the number of admissible integer temperatures between 93 and 97 degrees, inclusive. There are 3: 93, 94 and 97 degrees are all admissible.
In her third question, she wants to know the number of admissible integer temperatures between 95 and 96 degrees, inclusive. There are none.
In her final question, she wants to know the number of admissible integer temperatures between 90 and 100 degrees, inclusive. There are 4: 92, 93, 94 and 97 degrees are all admissible.
In the second test case, Karen knows 2 recipes.
1. The first one, "wikiHow to make Cold Brew Coffee", recommends brewing the coffee at exactly 1 degree.
2. The second one, "What good is coffee that isn't brewed at at least 36.3306 times the temperature of the surface of the sun?", recommends brewing the coffee at exactly 200000 degrees.
A temperature is _admissible_ if at least 1 recipe recommends it.
In her first and only question, she wants to know the number of admissible integer temperatures that are actually reasonable. There are none.
**Definitions**
Let $ n, k, q \in \mathbb{Z}^+ $ with $ 1 \leq k \leq n \leq 200000 $ and $ 1 \leq q \leq 200000 $.
Let $ R = \{(l_i, r_i) \mid i \in \{1, \dots, n\}\} $ be a set of $ n $ intervals, where each $ l_i, r_i \in \mathbb{Z} $ and $ 1 \leq l_i \leq r_i \leq 200000 $.
Let $ T = \{ t \in \mathbb{Z} \mid 1 \leq t \leq 200000 \} $ be the set of all possible integer temperatures.
For each $ t \in T $, define the coverage count:
$$ c(t) = \left| \left\{ i \in \{1, \dots, n\} \mid t \in [l_i, r_i] \right\} \right| $$
A temperature $ t \in T $ is **admissible** if and only if $ c(t) \geq k $.
Let $ A = \{ t \in T \mid c(t) \geq k \} $ be the set of admissible temperatures.
**Constraints**
1. $ 1 \leq k \leq n \leq 200000 $
2. $ 1 \leq l_i \leq r_i \leq 200000 $ for all $ i \in \{1, \dots, n\} $
3. $ 1 \leq a_j \leq b_j \leq 200000 $ for each query $ j \in \{1, \dots, q\} $
**Objective**
For each query $ j \in \{1, \dots, q\} $, compute:
$$
\left| A \cap [a_j, b_j] \right|
$$
where $ [a_j, b_j] = \{ t \in \mathbb{Z} \mid a_j \leq t \leq b_j \} $.