#include <bits/stdc++.h>

using namespace std;


int n, m, a[70006];

FILE *fin, *fout;


void Update(int p, int val)
{
    int t;
    a[p] -= val;
    while (p >= 1)
    {
        t = p / 2;
        a[t] -= val;
        p = t;
    }
}

int Query(int root, int x, int y, int st, int dr)
{
    if (x == st && y == dr)
        return a[root];
    int m = (st + dr) / 2;
    if (y <= m)
        return Query(2 * root, x, y, st, m);
    else if (x >= m + 1)
        return Query(2 * root + 1, x , y, m + 1, dr);
    return Query(2 * root, x, m, st, m) + Query(2 * root + 1, m + 1, y, m + 1, dr);
}

int main()
{
    fin = fopen("datorii.in", "r");
    fout = fopen("datorii.out", "w");
    fscanf(fin, "%d %d\n", &n, &m);
    int k;
    for (k = 1; k < n; k *= 2)
        ;
    for (int i = k; i < k + n; i++)
        fscanf(fin, "%d\n", &a[i]);
    n= k;
    for (int i = n - 1; i > 0; i--)
        a[i] = a[2 * i] + a[2 * i + 1];
    while (m--)
    {
        int task, x , y;
        fscanf(fin, "%d %d %d\n", &task, &x, &y);
        if (task == 0)
        {
            Update(n - 1 + x, y);
        }
        else
        {
            fprintf(fout, "%d",Query (1, x, y, 1, n));
            fprintf(fout, "\n");
        }
    }
    return 0;
}