#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long INF = LLONG_MAX;
vector<string> &split(const std::string &s, char delim, vector<string> &e) {
  stringstream ss(s);
  string item;
  while (getline(ss, item, delim)) e.push_back(item);
  return e;
}
long long Pow(long long a, int b, int Mo) {
  long long ans = 1;
  for (; b; b >>= 1, a = a * a % Mo)
    if (b & 1) ans = ans * a % Mo;
  return ans;
}
long solve() { return 0; }
int main(int argc, char const *argv[]) {
  std::ios::sync_with_stdio(false);
  int n, m;
  cin >> n;
  std::vector<long long> v(n + 1, 0);
  for (int i = 0; i < n; ++i) {
    cin >> v[i + 1];
  }
  std::vector<long long> s = v;
  sort(s.begin(), s.end());
  for (int i = 0; i < n; ++i) {
    v[i + 1] += v[i];
    s[i + 1] += s[i];
  }
  cin >> m;
  while (m--) {
    int t, l, r;
    cin >> t >> l >> r;
    l--, r--;
    if (t == 1) {
      cout << v[r + 1] - v[l] << '\n';
    } else
      cout << s[r + 1] - s[l] << '\n';
  }
  return 0;
}
