#include <bits/stdc++.h>
using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using P = pair<int, int>;
using P3 = pair<int,P>;
using PP = pair<P, P>;
constexpr int INF32 = 1 << 30;
constexpr ll INF64 = 1LL << 62;
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int di[] = {0, 1, 0, -1};
constexpr int dj[] = {1, 0, -1, 0};
constexpr int di8[] = {0, 1, 1, 1, 0, -1, -1, -1};
constexpr int dj8[] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr double EPS = 1e-10;
const double PI = acos(-1);

#define ALL(v) (v).begin(),(v).end()
#define REP(i,n) for(int i=0,i_len=n; i<i_len; ++i)

template<typename T1,typename T2> bool chmax(T1 &a, T2 b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T1,typename T2> bool chmin(T1 &a, T2 b) { if (b<a) { a=b; return 1; } return 0; }

template <typename T>
struct BIT {
    int N;
    std::vector<T> bit;

    BIT() = default;
    BIT(int n) {init(n);}
    void init(int n){
        N = n;
        bit.assign(n+1, 0);
    }
    T getSum(int i) {  // i番目までの要素の和を求める(1-index)
        T sum = 0;
        while (i > 0) {
            sum += bit[i];
            i -= i & -i;
        }
        return sum;
    }
    void add(int i, T x) {  // i番目の要素にxを加算
        while (i <= N) {
            bit[i] += x;
            i += i & -i;
        }
    }
};

int n, q;
BIT<ll> bit, cnt;

int getIndex(int x){
    int ok = 0, ng = n+1;
    while(abs(ok-ng)>1){
        int mid = (ok+ng)/2;
        if(cnt.getSum(mid)<=x){
            ok = mid;
        }else{
            ng = mid;
        }
    }
    return ok;
}

int solve(){
    cin >> n >> q;
    bit.init(n);
    cnt.init(n);
    REP(i,n){
        ll a;
        cin >> a;
        bit.add(i+1, a);
        cnt.add(i+1, 1);
    }
    set<int> st;
    REP(i,n) st.insert(i);
    REP(i,q){
        int t, l, r;
        cin >> t >> l >> r;
        l = getIndex(l-1);
        r = getIndex(r);
        // cout << l << " " << r << endl;
        if(t==1){
            while(1){
                auto itr = st.lower_bound(l+1);
                if(itr == st.end() || *itr >= r) break;
                cnt.add(*itr+1,-1);
                // cout << *itr << endl;
                st.erase(itr);
            }
        }else{
            cout << bit.getSum(r)-bit.getSum(l) << endl;
        }
    }
    return 0;
}

int main(){
    cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);
    // int t; cin >> t; for(int i=0;i<t;i++) solve();
    // while(!solve());
    solve();
    return 0;
}