#include <bits/stdc++.h>
using namespace std;
ifstream in ("datorii.in");
ofstream out ("datorii.out");
int v[15005], n, m;
long query(int x)
{
    long s = 0;
    for(int i = x; i >= 1; i -= i & -i)
        s += v[i];
    return s;
}
void update(int x, int y)
{
    for(int i = y; i <= n; i += i & -i)
        v[i] += x;
}
void citire()
{
    in >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        int a;
        in >> a;
        update(a, i);
    }
    for(int i = 1; i <= m; ++i)
    {
        int a, b, c;
        in >> a >> b >> c;
        if(!a)
            update(-c, b);
        else
            out << query(c) - query(b - 1) << '\n';
    }
}
int main()
{
    citire();
    return 0;
}