#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long n;
vector<long long> BIT(200020), BIT1(200020);
void add(long long i, long long x) {
	while (i <= n) {
		BIT[i] += x;
		i += i & -i;
	}
}
long long csum(long long i) {
	long long count = 0;
	while (i > 0) {
		count += BIT[i];
		i -= i & -i;
	}
	return count;
}
long long sum(long long l, long long r) {
	return csum(r) - csum(l - 1);
}
void add1(long long i, long long x) {
	while (i <= n) {
		BIT1[i] += x;
		i += i & -i;
	}
}
long long csum1(long long i) {
	long long count = 0;
	while (i > 0) {
		count += BIT1[i];
		i -= i & -i;
	}
	return count;
}
long long sum1(long long l, long long r) {
	return csum1(r) - csum1(l - 1);
}
int main() {
	int q;
	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		long long a;
		cin >> a;
		add(i, a);
	}
	for (int i = 0; i < q; i++) {
		int t, l, r;
		cin >> t >> l >> r;
		if (t == 1) {
			int p = sum1(1, l - 1);
			l += p, r += p;
			add1(l, r - l);
		}
		else {
			int p = sum1(1, l - 1);
			l += p, r += p;
			int p1 = sum1(l, r);
			r += p1;
			cout << sum(l, r) << endl;
		}
	}
}