Kuriyama Mirai's Stones

2000ms

262144K

Description:

Kuriyama Mirai has killed many monsters and got many (namely n) stones. She numbers the stones from 1 to n. The cost of the i-th stone is v_i. Kuriyama Mirai wants to know something about these stones so she will ask you two kinds of questions:

She will tell you two numbers, l and r (1 ≤ l ≤ r ≤ n), and you should tell her $\text{[math]}$ .
Let u_i be the cost of the i-th cheapest stone (the cost that will be on the i-th place if we arrange all the stone costs in non-decreasing order). This time she will tell you two numbers, l and r (1 ≤ l ≤ r ≤ n), and you should tell her $\text{[math]}$ .

For every question you should give the correct answer, or Kuriyama Mirai will say "fuyukai desu" and then become unhappy.

Input:

The first line contains an integer n (1 ≤ n ≤ 10⁵). The second line contains n integers: v₁, v₂, ..., v_n (1 ≤ v_i ≤ 10⁹) — costs of the stones.

The third line contains an integer m (1 ≤ m ≤ 10⁵) — the number of Kuriyama Mirai's questions. Then follow m lines, each line contains three integers type, l and r (1 ≤ l ≤ r ≤ n; 1 ≤ type ≤ 2), describing a question. If type equal to 1, then you should output the answer for the first question, else you should output the answer for the second one.

Output:

Print m lines. Each line must contain an integer — the answer to Kuriyama Mirai's question. Print the answers to the questions in the order of input.

Sample Input:

6
6 4 2 7 2 7
3
2 3 6
1 3 4
1 1 6

Sample Output:

24
9
28

Sample Input:

Sample Output:

Note:

Please note that the answers to the questions may overflow 32-bit integer type.

Informação

Provedor Codeforces

Código CF433B