#include <bits/stdc++.h>
using namespace std;

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

int aib[100005], n, q;

void Update(int p, int x)
{
    while (p <= n)
    {
        aib[p] -= x;
        p += (p & (-p));
    }
}

void Update1(int p, int x)
{
    while (p <= n)
    {
        aib[p] += x;
        p += (p & (-p));
    }
}

int Query(int p)
{
    int suma = 0;
    while (p > 0)
    {
        suma += aib[p];
        p -= (p & (-p));
    }
    return suma;
}

int main()
{
    int i, x, y, op;
    fin >> n >> q;
    for (i = 1; i <= n; i++)
    {
        fin >> x;
        Update1(i, x);
    }
    for(i=1;i<=q;i++)
    {
        fin >> op >> x >> y;
        if(op == 0) Update(x, y);
        else fout << Query(y) - Query(x - 1) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}