#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

/**
 * @brief https://tkmst201.github.io/Library/DataStructure/BinaryIndexedTree.hpp
 */
template<typename T>
struct BinaryIndexedTree {
	using value_type = T;
	using const_reference = const value_type &;
	using F = std::function<value_type (const_reference, const_reference)>;
	using size_type = std::size_t;
	
private:
	size_type n;
	value_type id_elem;
	F f;
	std::vector<value_type> node;
	
public:
	BinaryIndexedTree(size_type n, const_reference id_elem, const F & f)
		: n(n), id_elem(id_elem), f(f), node(n + 1, id_elem) {}
	
	size_type size() const noexcept {
		return n;
	}
	
	void add(size_type i, const_reference x) noexcept {
		assert(i < size());
		++i;
		for (; i <= size(); i += i & -i) node[i] = f(node[i], x);
	}
	
	value_type sum(size_type i) const noexcept {
		assert(i <= size());
		value_type res = id_elem;
		for (; i > 0; i -= i & -i) res = f(node[i], res);
		return res;
	}
	
	size_type lower_bound(const_reference x) const noexcept {
		size_type res = 0;
		size_type s = id_elem, w = 1;
		while (w < size()) w <<= 1;
		for (; w > 0; w >>= 1) {
			if (res + w <= size()) {
				value_type cur = f(s, node[res + w]);
				if (cur < x) {
					res += w;
					s = cur;
				}
			}
		}
		return res;
	}
};

int main() {
	int N, Q;
	cin >> N >> Q;
	BinaryIndexedTree<ll> bit(N, 0, [](auto x, auto y) { return x + y; });
	auto bitp = bit;
	REP(i, N) bitp.add(i, 1);
	REP(i, N) {
		int a;
		scanf("%d", &a);
		bit.add(i, a);
	}
	vector<int> prv(N + 1);
	REP(i, N + 1) prv[i] = i - 1;
	// prv[0] = -1 に注意
	
	while (Q--) {
		int t, l, r;
		scanf("%d %d %d", &t, &l, &r);
		--l;
		
		auto get_pos = [&](int p) {
			return bitp.lower_bound(p + 1);
		};
		
		auto sum = [&](int p) {
			return bit.sum(get_pos(p));
		};
		
		if (t == 1) {
			int rp = get_pos(r);
			int lp = get_pos(l);
			const int nerp = prv[rp];
			prv[rp] = lp;
			rp = nerp;
			
			ll s = 0;
			while (rp >= lp) {
				int nex = prv[rp];
				ll cur = bit.sum(rp + 1) - bit.sum(rp);
				bit.add(rp, -cur);
				s += cur;
				if (rp != lp) {
					prv[rp] = lp;
					bitp.add(rp, -1);
				}
				rp = nex;
			}
			bit.add(lp, s);
		}
		else printf("%lld\n", sum(r) - sum(l));
	}
}