#include<stdio.h>
using namespace std;
const int N = 15005;
long long aib[N];
void update (int poz, long long val, int n)
{
    while (poz <= n)
    {
        aib[poz] += val;
        poz += poz & -poz;
    }
}
long long interog (int poz)
{
    long long s = 0;
    while (poz > 0)
    {
        s += aib[poz];
        poz -= poz & -poz;
    }
    return s;
}
int main ()
{
    FILE *in, *out;
    in = fopen ("datorii.in", "r");
    out = fopen ("datorii.out", "w");
    int n, m;
    fscanf (in, "%d%d", &n, &m);
    long long x;
    int i;
    for (i = 1; i <= n; i++)
    {
        fscanf (in, "%lld", &x);
        update (i, x, n);
    }
    bool cerinta;
    int t, v;
    for (i = 1; i <= m; i++)
    {
        fscanf (in, "%d", &cerinta);
        if (cerinta == 0)
        {
            fscanf (in, "%d%d", &t, &v);
            update (t, -v, n);
        }
        else
        {
            fscanf (in, "%d%d", &t, &v);
            fprintf (out, "%lld\n", interog(v) - interog(t - 1));
        }
    }
    return 0;
}