/*Rofyda Mohamed Hamed Hamed Elghadban*/
 //#include <bits/stdc++.h>
 #include <iostream>
 #include <iomanip>
 #include <cmath>
 #include <algorithm>
 #include <cstdlib>
 #include <limits.h>
 #include <string>
 #include <vector>
 #include <map>
 #include <stack>
 #include <set>
 #include <deque>
 #include <fstream>
 #include <bitset>
 #include <cmath>
 #include <numeric>
 #include <cstring>
 #include <utility>
 #include <queue>

 /***********************************************************************************/

 #define ll long long
 #define ull unsigned long long
 #define pi 3.141592654
 #define NUM 1e18
 #define Mod  1'000'000'007
 #define fixed(n) fixed<<setprecision(n)
 #define cin(v) for(auto &i:v) cin >> i ;
 #define cout(v) for(auto &i:v) cout << i  <<" ";
 #define Ceil(a,b) ((a/b)+(a%b ? 1 : 0))
 #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
 #define small(x) (x>=97&&x<=122)
 #define capital(x) (x>=65&&x<=90)
 #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
 #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
 #define all(v) ((v).begin()), ((v).end())
 #define allr(v) ((v).rbegin()), ((v).rend())
 #define updmax(a,b) a=max(a,b)
 #define updmin(a,b) a=min(a,b)
 #define ceil(a,b) ((a/b)+(a%b?1:0))
 /* asc -> 1 2 3 ,des -> 3 2 1 */

 /***********************************************************************************/

 using namespace std;

 void Rofyda_Elghadban(){
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
   #endif
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
 }

 void solve(){
 }

 int main(){
  Rofyda_Elghadban();
 //freopen("input.txt","r",stdin);
 //freopen("output.txt","r",stdout);

 //solve();

 int n;
 cin>>n;
 vector<int>v(n+1);
 v[0]=0;
 for(int i=1;i<n+1;i++){
  cin>>v[i];
 }
 ll prefix[n+2]{};
 int q;
 cin>>q;
 while(q--){
  int t,l,r,sum=0;
  cin>>t>>l>>r;
    if(t==1){
    for(int i=1;i<=v.size();i++){
      prefix[i]=v[i]+prefix[i-1];
    }
  }else if(t==2){
    sort(all(v));
    for(int i=1;i<=v.size();i++){
      prefix[i]=v[i]+prefix[i-1];
    }
  }
  cout<<prefix[r]-prefix[l-1]<<" ";
  cout<<"\n";
 }




 return 0;
}


/*

* * * * * * * *    * * * * * * * *    * * * * * * * *    *             *
*             *    *             *    *                  *             *
*             *    *             *    *                  *             *
*             *    *             *    *                  *             *
* * * * * * * *    *             *    * * * * * * * *    * * * * * * * *
* *                *             *    *                                *
*   *              *             *    *                                *
*     *            *             *    *                                *
*       *          *             *    *                                *
*         *        *             *    *                                *
*           *      *             *    *                                *
*             *    * * * * * * * *    *                  * * * * * * * *

*/