#include <bits/stdc++.h>

using namespace std;

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

int n, m, a[15001], v[60001], res = 0;

void init(int nod, int st, int dr)
{
    if(st == dr)
        v[nod] = a[st];
    else
    {
        int mid = (st+dr) / 2;
        init(2*nod, st, mid);
        init(2*nod+1, mid+1, dr);
        v[nod] = v[2*nod] + v[2*nod+1];
    }
}

void update(int nod, int st, int dr, int poz, int sum)
{
    if(st == dr)
        v[nod] -= sum;
    else
    {
        int mid = (st+dr)/2;
        if(poz <= mid)
            update(2*nod, st, mid, poz, sum);
        else
            update(2*nod+1, mid+1, dr, poz, sum);
        v[nod] = v[2*nod] + v[2*nod+1];
    }
}

void query(int nod, int st, int dr, int s, int d)
{
    if(st >= s && dr <= d)
        res += v[nod], return;
    else
    {
        int mid = (st+dr)/2;
        if(s <= mid)
            query(2*nod, st, mid, s, d);
        if(d > mid)
            query(2*nod+1, mid+1, dr, s, d);
    }
}

int main ()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> a[i];
    init(1,1,n);
    for(int i = 1; i <= m; i++)
    {
        int t, x, y;
        fin >> t >> x >> y;
        if(t)
        {
            query(1, 1, n, x, y);
            fout << res << '\n';
            res = 0;
        }
        else
            update(1, 1, n, x, y);
    }

    return 0;
}