#include <iostream>
#include <fstream>
#include <cstring>

#define NMAX 100005

using namespace std;

inline int zeros(int x)
{
	return x & (-x);
}

class AIB
{
private:
	int tree[NMAX];
	int size;

public:
	AIB(int dim)
	{
		size = dim;
		memset(tree, 0, sizeof(tree));
	};
	void Add(int poz, int val)
	{
		for (; poz <= size; poz += zeros(poz))
			tree[poz] += val;
	}
	void Pay(int poz, int val)
	{
		for (; poz <= size; poz += zeros(poz))
			tree[poz] -= val;
	}
	int Query(int poz)
	{
		int result = 0;
		for (; poz > 0; poz -= zeros(poz))
			result += tree[poz];
		return result;
	}
	int SearchSum(int k)
	{
		int poz = 0;
		int step = 1;
		for (; step < size; step <<= 1);
		for (; step; step >>= 1)
		{
			if (poz + step <= size && tree[poz + step] <= k)
			{
				poz += step;
				k -= tree[poz];
				if (k == 0) return poz;
			}
		}
		return -1;
	}

};

int main()
{
	int n, m;
	ios_base::sync_with_stdio(false);

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

	fin >> n >> m;

	AIB arb(n + 5);

	for (int i = 1; i <= n; ++i)
	{
		int x;
		fin >> x;
		arb.Add(i, x);
	}

	for (int i = 1; i <= m; ++i)
	{
		int t, a, b;
		fin >> t >> a >> b;
		if (t == 0)
			arb.Pay(a, b);
		else
			fout << arb.Query(b) - arb.Query(a - 1) << '\n';
	}
	
	return 0;
}