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

#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define lch (o << 1)
#define rch (o << 1 | 1)

typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pint;
typedef tuple<int, int, int> tint;

const int N = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const ll INF_LL = 0x3f3f3f3f3f3f3f3f;

struct SegTree {
	static const int M = 4 * N;

	ll t[M];
	int s[M];

	void maintain(int o) {
		t[o] = t[lch] + t[rch];
		s[o] = s[lch] + s[rch];
	}

	void build(int o, int L, int R, int a[]) {
		if (L == R) {
			t[o] = a[L];
			s[o] = 1;
			return;
		}
		int M = (L + R) / 2;
		build(lch, L, M, a);
		build(rch, M + 1, R, a);
		maintain(o);
	}

	void modify(int o, int L, int R, int rnk, ll val, int sum) {
		if (L == R) {
			t[o] = val;
			s[o] = sum;
			return;
		}
		int M = (L + R) / 2;
		if (rnk <= s[lch])
			modify(lch, L, M, rnk, val, sum);
		else
			modify(rch, M + 1, R, rnk - s[lch], val, sum);
		maintain(o);
	}

	// 返回前缀和
	ll query(int o, int L, int R, int rnk) {
		if (rnk == 0) return 0LL;
		if (L == R) {
			return t[o];
		}
		int M = (L + R) / 2;
		if (rnk <= s[lch])
			return query(lch, L, M, rnk);
		else
			return t[lch] + query(rch, M + 1, R, rnk - s[lch]);
	}
};
SegTree seg;

int a[N];

int main() {
	ios::sync_with_stdio(0);

	int n, q;
	cin >> n >> q;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	seg.build(1, 1, n, a);

	while (q--) {
		int op, l, r;
		cin >> op >> l >> r;
		if (op == 1) {
			ll sum = seg.query(1, 1, n, r) - seg.query(1, 1, n, l - 1);
			seg.modify(1, 1, n, l, sum, 1);
			for (int i = l + 1; i <= r; i++)
				seg.modify(1, 1, n, l + 1, 0, 0);
		}
		if (op == 2) {
			ll sum = seg.query(1, 1, n, r) - seg.query(1, 1, n, l - 1);
			cout << sum << endl;
		}
	}

	return 0;
}