#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int bm = 200201;
int BIT[bm];
void add(int A, int B) {
	while (A <= bm) {
		BIT[A] += B;
		A += A & -A;
	}
}
int query(int A) {
	int ret = 0;
	while (A > 0) {
		ret += BIT[A];
		A -= A & -A;
	}
	return ret;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N, Q;
	cin >> N >> Q;
	int A[200200];
	ll S[200200] = {};
	rep1(i, N) cin >> A[i];
	rep(i, N) S[i + 1] = S[i] + A[i + 1];

	rep1(i, N) {
		add(i, 1);
	}

	rep(q, Q) {
		int t, l, r;
		cin >> t >> l >> r;


		if (t == 1) {
			add(l, (r - l));
		}
		else {
			int L = ((l == 1) ? 0 : query(l - 1)), R = query(r);
			co(S[R] - S[L]);
		}
	}

	Would you please return 0;
}