#include <bits/stdc++.h>

using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n, Q;
int aib[15005];
void Update(int p, int x)
{
    while(p <= n)
    {
        aib[p] += x;
        p += (p & (-p));
    }
}
void UpdateMinus(int p, int x)
{
    while(p <= n)
    {
        aib[p] -= x;
        p += (p & (-p));
    }
}
int Query(int p)
{
    int Sum = 0;
    while(p > 0)
    {
        Sum += aib[p];
        p -= (p & (-p));
    }
    return Sum;
}
int main()
{
    int i, x, y, op;
    fin >> n >> Q;
    for(i = 1; i <= n; i++)
    {
        fin >> x;
        Update(i, x);
    }
    for(i = 1; i <= Q; i++)
    {
        fin >> op >> x >> y;
        if(op == 0)
            UpdateMinus(x, y);
        else
        {
            fout << Query(y) - Query(x - 1) << "\n";
        }
    }
    return 0;
}