B. Kuriyama Mirai's Stones（有时候暴力解决一切）

memory limit per test

256 megabytes

input

standard input

output

standard output

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 .
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 .

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.

Sample test(s)

#include <iostream>

#include <stdio.h>
#include <string.h>
#include <algorithm>


using namespace std;


long long int num[100005]={0};
long long int a[100005]={0};
long long int b[100005]={0};


int main()
{
    //memset(a,0,sizeof(a));
   // memset(b,0,sizeof(b));
   a[0] = b[0] = 0;
    int n;
    scanf("%d",&n);
    for( int i = 1; i<=n; i++)
     scanf("%d",&num[i]);
     a[1] = num[1];
    for( int i = 2; i<=n; i++)
      a[i] = a[i-1] + num[i];
     sort(num+1,num+n+1);
     b[1] = num[1];
    for( int i = 2; i<=n; i++)
    {
        b[i] = b[i-1] +num[i];
       // cout<<b[i]<<"b"<<endl;
    }


     int que,type,l, r;


     scanf("%d",&que);
     for( int i =0; i<que; i++)
     {
         scanf("%d %d %d",&type, &l , &r);
         //cout<<"s"<<endl;
         if(type == 1)
          printf("%lld\n",a[r]-a[l-1]);
        if(type == 2)
          printf("%lld\n",b[r]-b[l-1]);


     }




}