write a go solution for Description:
You are given a one-based array consisting of N integers: A_1,A_2,*s,A_N. Initially, the value of each element is set to 0.

There are M operations (numbered from 1 to M). Operation i is represented by langleL_i,R_i,X_irangle. If operation i is executed, all elements A_j for L_i<=j<=R_i will be increased by X_i.

You have to answer Q independent queries. Each query is represented by langleK,S,Trangle which represents the following task. Choose a range [l,r] satisfying S<=l<=r<=T, and execute operations l,l+1,...,r. The answer to the query is the maximum value of A_K after the operations are executed among all possible choices of l and r.

Input Format:
The first line consists of two integers N M (1<=N,M<=100,000).

Each of the next M lines consists of three integers L_i R_i X_i (1<=L_i<=R_i<=N;-100,000<=X_i<=100,000).

The following line consists of an integer Q (1<=Q<=100,000).

Each of the next Q lines consists of three integers K S T (1<=K<=N;1<=S<=T<=M).

Output Format:
For each query, output in a single line, an integer which represent the answer of the query.

Note:
Explanation for the sample input/output #1

For query 1, one of the solutions is to execute operation 4 and 5.

For query 2, one of the solutions is to execute operation 4, 5, and 6.

For query 3, the only solution is to execute operation 3.

For query 4, the only solution is to execute operation 1.

For query 6, the only solution is to execute operation 2.. Output only the code with no comments, explanation, or additional text.