#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"

typedef pair<long long, int> P;
//data
/*struct S {
	long long num;
	int info;
};
//lazy
struct F {
	long long num;
	int info;
};*/
//★自分で編集
//S*S->S
/*P op(P s_l, P s_r) { return { s_l.first + s_r.first ,s_l.second + s_r.second }; }

//op(a,e) = a = op(e,a)なeを返す
P e() { return { (long long)0,0 }; }

//f(x)を返す関数
P mapping(P f, P s) {
	if (f.second == -1) { return s; }
	return f;
}

//f(g(x))の合成関数
//c(ax+b)+d = acx+(bc+d)
//rが先
P composition(P f, P g) {
	if (f.second == -1) { return g; }
	if (g.second == -1) { return f; }
	return f;
}

//mapping(id,a) = aなidを返す
P id() { return P{ (long long)0,-1 }; }

int target;
bool f(P v) { return v.second <= target; }*/



pair<long long, int> op(pair<long long, int> a, pair<long long, int> b) {
	a.first += b.first;
	a.second += b.second;
	return a;
}

pair<long long, int> e() {
	return make_pair(0LL, 0);
}

pair<long long, int> mapping(pair<long long, int> a, pair<long long, int> b) {
	if (a.second == -1)return b;
	return a;
}

pair<long long, int> composition(pair<long long, int> a, pair<long long, int> b) {
	if (a.second == -1)return b;
	if (b.second == -1)return a;
	return a;
}

pair<long long, int> id() {
	return make_pair(0LL, -1);
}

int y;
bool g(pair<long long, int> x) {
	return x.second <= y;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N, Q;
	cin >> N >> Q;
	vector<long long>A(N);
	vector<P>a(N);
	rep(i, N) {
		cin >> A[i];
		a[i] = { A[i],1 };
	}
	lazy_segtree<P, op, e, P, mapping, composition, id> seg(a);
	while (Q--) {
		int t, l, r;
		cin >> t >> l >> r;
		y = l - 1;
		int xl = seg.max_right<g>(0);
		y = r;
		int xr = seg.max_right<g>(0);
		if (1 == t) {
			//更新
			int sum = seg.prod(xl, xr).first;
			seg.apply(xl, xr, { 0,0 });
			seg.apply(xl, xl + 1, { sum ,1 });
		}
		else {
			//取得
			cout << seg.prod(xl, xr).first << endl;
		}
	}
	return 0;
}