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:

  1. She will tell you two numbers, l and r (1 ≤ l ≤ r ≤ n), and you should tell her <image>. 
  2. 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 ≤ l ≤ r ≤ n), and you should tell her <image>. 



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 ≤ 105). The second line contains n integers: v1, v2, ..., vn (1 ≤ vi ≤ 109) — costs of the stones. 

The third line contains an integer m (1 ≤ m ≤ 105) — 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.

Examples

Input

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


Output

24
9
28


Input

4
5 5 2 3
10
1 2 4
2 1 4
1 1 1
2 1 4
2 1 2
1 1 1
1 3 3
1 1 3
1 4 4
1 2 2


Output

10
15
5
15
5
5
2
12
3
5

Note

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

# Author: SaykaT
# Problem: 433B
# Time Created: August 02(Sunday) 2020 || 12:03:48

#>-------------------------<#
import sys

input = sys.stdin.readline

# Helper Functions. -> Don't cluster your code.
def prefix_sum(ls):
    l1 = sorted(ls)

    normal, inc = [ls[0]], [l1[0]]

    for i in range(1, len(ls)):
        normal.append(normal[i-1] + ls[i])
        inc.append(inc[i-1] + l1[i])

    return [normal, inc]

# IO Functions. -> Input output
def io():
    n = int(input())
    ls = list(map(int, input().split()))
    m = int(input())
    queries = []
    for _ in range(m):
        tmp = list(map(int, input().split()))
        queries.append(tmp)

    return [n, ls, m, queries]

# Main functions. -> Write the main solution here
def solve():
    n, ls, m, queries = io()
    normal, inc = prefix_sum(ls)


    for i in range(m):
        types = queries[i][0]
        l = queries[i][1]
        r = queries[i][2] - 1

        if l != 1:
            l -= 2
        else:
            l = -1

        if types == 1 and l >= 0:
            print(normal[r] - normal[l])
        elif types == 2 and l >= 0:
            print(inc[r] - inc[l])
        elif types == 1 and l < 0:
            print(normal[r])
        elif types == 2 and l < 0:
            print(inc[r])



# Multiple test cases. -> When you have T test cases.
solve()
