#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
using graph = vector<VI>;
template<class T = ll> using w_graph = vector<vector<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }
template<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }
template<class T>inline void END(T s) { print(s); exit(0); }
void END() { exit(0); }

class BIT {
    int n;
    VI dat;
public:
    BIT(int n) : n(n), dat(n + 1) {};
    BIT(int n, int a) : n(n), dat(n + 1) {
        eFOR(i, 1, n) {
            dat[i] += a;
            if (i + (i & -i) <= n)dat[i + (i & -i)] += dat[i];
        }
    }
    BIT(VI v) : n(v.size()), dat(n + 1) {
        eFOR(i, 1, n) {
            dat[i] += v[i];
            if (i + (i & -i) <= n)dat[i + (i & -i)] += dat[i];
        }
    }
    void add(int i, int a) {
        for (++i; i <= n; i += i & -i)dat[i] += a;
    }
    int sum(int r) {
        int res = 0;
        for (++r; r; r -= r & -r)res += dat[r];
        return res;
    }
    int sum(int l, int r) {
        if (l < 0 || n <= r || l > r)return 0;
        return sum(r) - (l == 0 ? 0 : sum(l - 1));
    }
    int lower_bound(int a) {
        int res = 0, k = 1;
        for (; k * 2 <= n; k *= 2);
        for (; k; k /= 2) {
            if (res + k <= n && a > dat[res + k]) {
                a -= dat[res + k];
                res += k;
            }
        }
        return res;
    }
};

int main() {
    init();

  int n,q;cin>>n>>q;

    VL a(n);cin>>a;

    FOR(i, 1, n)a[i] += a[i - 1];

    BIT bit(n, 1);
    while (q--) {
      int t,l,r;cin>>t>>l>>r;
        if (t == 1) {
            int d = r - l;
            while (d--)bit.add(bit.lower_bound(l + 1), -1);
        }
        else print(sum(a, bit.lower_bound(l), bit.lower_bound(r + 1) - 1));
    }

    return 0;
}