#include <fstream>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include<bitset>
#include <map>
#include <cstring>
#include<algorithm>
#define MOD 1234567
using namespace std;

ifstream fin("datorii.in");
ofstream fout("datorii.out");

int n, m;
long long int A[15001];

void update(long long int val, int poz)
{
	//merg la dreapta lui poz si adaug in toti arborii binari valoarea lui val
	for (int i = poz; i <= n; i += (i & (-i)))
	{
		A[i] += val;
	}
}

long long int sum(int poz)
{
	long long int s = 0;
	for (int i = poz; i >= 1; i -= (i & (-i))) {
		s += A[i];
	}
	return s;
}

int main()
{


	fin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		long long int x;
		fin >> x;
		update(x, i);
	}

	for (int i = 1; i <= m; i++)
	{
		int c, y;
		long long int x;
		fin >> c >> x >> y;
		if (c == 1)
		{
			fout << sum(y) - sum(x - 1)<<"\n";
		}
		else {
			update(x, y);
		}
	}
	return 0;

}