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 vi. 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 \le l \le r \le n), and you should tell her . Let ui 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 \le l \le r \le n), and you should tell her . 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 \le n \le 105). The second line contains n integers: v1,v2,...,vn(1 \le vi \le 109) - costs of the stones. The third line contains an integer m(1 \le m \le 105) - the number of Kuriyama Mirai's questions. Then follow m lines, each line contains three integers type, l and r(1 \le l \le r \le n;1 \le type \le 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.

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