The j-th Number

You have $N$ empty arrays $t_1, t_2, \dots, t_N$. First you run $M$ insert operations in the given order.

• for every $i$ with $a \le i \le b$, put one copy of the value $v$ into the array $t_i$

After every insertion is done, you answer $Q$ queries.

• collect the values of every array $t_i$ with $x \le i \le y$, sort them in non-decreasing order, and print the $j$-th value of that sequence

The same value can enter one array several times, and duplicates stay in the sorted sequence.

The input has the following format.

N M Q
a1 b1 v1
...
aM bM vM
x1 y1 j1
...
xQ yQ jQ

The first line contains three integers $N$, $M$ and $Q$ ($1 \le N \le 10^9$, $1 \le M \le 10^5$, $1 \le Q \le 10^5$).

Each of the next $M$ lines describes one insert operation with three integers $a_i$, $b_i$ and $v_i$ ($1 \le a_i \le b_i \le N$, $1 \le v_i \le 10^9$).

Each of the following $Q$ lines describes one query with three integers $x_i$, $y_i$ and $j_i$ ($1 \le x_i \le y_i \le N$, $1 \le j_i \le \sum_{x_i \le k \le y_i} |t_k|$), where $|t_k|$ is the number of values stored in the array $t_k$.

For each query, print the $j$-th value on its own line.

In the first example, the arrays look like this once every insert operation is done.

[1,3], [1], [1,2], [1,1,2], [1,1]

Collecting the values of $t_1$, $t_2$ and $t_3$ and sorting them gives $[1,1,1,2,3]$, and the 4th value of that sequence is 2.