#include <bits/stdc++.h>

using namespace std;

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

int v[15005], n, m;
long mama(int x)
{
    long s = 0;
    for(int i = x; i >= 1; i -= i & -i)
        s += v[i];
    return s;
}
void tata(int x, int y)
{
    for(int i = y; i <= n; i += i & -i)
        v[i] += x;
}
void bunica()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        int a;
        fin >> a;
        tata(a, i);
    }
    for(int i = 1; i <= m; ++i)
    {
        int a, b, c;
        fin >> a >> b >> c;
        if(!a)
            tata(-c, b);
        else
            fout << mama(c) - mama(b - 1) << '\n';
    }
}
int main()
{
    bunica();
    return 0;
}