Maximize The Value

You are given a one-based array of $N$ integers: $A_1, A_2, \cdots, A_N$. Initially, the value of each element is $0$.

There are $M$ operations, numbered from $1$ to $M$. Operation $i$ is $\langle L_i, R_i, X_i \rangle$. When operation $i$ is executed, every $A_j$ with $L_i \le j \le R_i$ increases by $X_i$.

You must answer $Q$ independent queries. Each query is $\langle K, S, T \rangle$, which asks you to choose a range $[l, r]$ with $S \le l \le r \le T$, then execute operations $l, l+1, \dots, r$ in order. The answer is the maximum value of $A_K$ after the operations are executed, taken over all possible choices of $l$ and $r$.

The first line contains two integers $N$ and $M$ ($1 \le N, M \le 100\,000$).

Each of the next $M$ lines contains three integers $L_i$, $R_i$, and $X_i$ ($1 \le L_i \le R_i \le N$; $-100\,000 \le X_i \le 100\,000$).

The next line contains an integer $Q$ ($1 \le Q \le 100\,000$).

Each of the next $Q$ lines contains three integers $K$, $S$, and $T$ ($1 \le K \le N$; $1 \le S \le T \le M$).

For each query, print the answer on a separate line.