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.

import java.util.*;

public class Solving {
    
private static Scanner in =new Scanner(System.in);
public static ArrayList<Long> getCum(ArrayList<Long>z){
             ArrayList<Long> cum=new ArrayList<Long>();
             cum.add(z.get(0));
             for(int i=1;i<z.size();i++)
                 cum.add(cum.get(i-1)+z.get(i));
             return cum;
         }
 public static void main(String[] args){
     ArrayList<Long> z=new ArrayList<Long>();
     int n=in.nextInt();
     for(int i=0;i<n;i++)
         z.add(in.nextLong());
     ArrayList<Long> cum1=getCum(z);
     Collections.sort(z);
     ArrayList<Long> cum2=getCum(z);
     
     int q=in.nextInt();
     for(int i=0;i<q;i++){
         int type=in.nextInt();
         int l=in.nextInt();
         int r=in.nextInt();
         long sum=0;
         if(type==1){
                     if(l==1)
                         sum=cum1.get(r-1);
                     else
                         sum=cum1.get(r-1)-cum1.get(l-2);
                 }
         else{
             if(l==1)
                         sum=cum2.get(r-1);
                     else
                         sum=cum2.get(r-1)-cum2.get(l-2);
         }
         System.out.println(sum);
     }
 }
}