Typhoon

There is a straight road that is prone to damage from typhoons. On this road, the damage from a typhoon is always a single contiguous segment. Along the road there are $k$ observation points, numbered $1$ to $k$ in order starting from the point closest to one end of the road.

There are records of $n$ typhoons that damaged this road. The record for typhoon $i$ is stored as the number $a_i$ of the lowest-numbered observation point damaged by typhoon $i$ and the number $b_i$ of the highest-numbered observation point damaged by typhoon $i$. Typhoons are numbered $1$ to $n$ in order from oldest to newest.

Recently it was discovered that studying typhoon damage on this road leads to a major advance in meteorology, and to carry out the research, $m$ pieces of information of the form "how many of the typhoons numbered $q_j$ through $r_j$ damaged observation point $p_j$" became necessary.

Given the typhoon records and the pairs of an observation point and a range of typhoon numbers for which information is needed to carry out the research (hereafter called queries), write a program that outputs, for each query, the number of typhoons that dealt damage.

The first line of the input contains three integers $n$, $m$, $k$ separated by spaces. These mean that the number of typhoons in the records is $n$, the number of queries given is $m$, and the number of observation points is $k$. They satisfy $1 \le n, m \le 100,000$ and $1 \le k \le 1,000,000,000$.

Line $1 + i$ ($1 \le i \le n$) contains two integers $a_i$, $b_i$ separated by spaces. These mean that the lowest-numbered observation point damaged by typhoon $i$ is $a_i$ and the highest-numbered observation point damaged by typhoon $i$ is $b_i$. They satisfy $1 \le a_i \le b_i \le k$.

Line $1 + n + j$ ($1 \le j \le m$) contains three integers $p_j$, $q_j$, $r_j$ separated by spaces. These mean that the $j$-th query has point number $p_j$ and typhoon number range from $q_j$ to $r_j$. They satisfy $1 \le p_j \le k$ and $1 \le q_j \le r_j \le n$.

Output to standard output. For each query, output the number of typhoons that dealt damage, in the given order, separated by newlines. That is, on line $j$ ($1 \le j \le m$), output a single integer representing how many of the typhoons numbered $q_j$ through $r_j$ damaged observation point $p_j$.