#include <bits/stdc++.h>

using namespace std;

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

vector <int> arb(400000);
int n, m;

void update(int nod, int st, int dr, int idx, int val)
{
    if(st == dr)
    {
        arb[nod] = val;
        return;
    }
    else
    {
        int mid = (st+dr) >> 1;
        if(idx <= mid)
            update(2 * nod, st, mid, idx, val);
        else
            update(2*nod+1, mid+1, dr, idx, val);
        arb[nod] = arb[2*nod] + arb[2*nod+1];
    }
}

void update2(int nod, int st, int dr, int idx, int val)
{
    if(st == dr)
    {
        arb[nod]-=val;
        return;
    }
    else
    {
        int mid = (st+dr) >> 1;
        if(idx <= mid)
            update2(2 * nod, st, mid, idx, val);
        else
            update2(2*nod+1, mid+1, dr, idx, val);
        arb[nod] = arb[2*nod] + arb[2*nod+1];
    }
}

int query(int nod, int st, int dr, int l, int r)
{
    if(st >= l && dr <= r)
        return arb[nod];
    else
    {
        int mid = (st+dr) >>1;
        int stanga=0, dreapta=0;
        if(l <= mid)
            stanga = query(2*nod, st, mid, l, r);
        if(r > mid)
            dreapta = query(2*nod+1, mid+1, dr, l, r);
        return (stanga + dreapta);
    }
}

int main()
{
    in>>n>>m;
    for(int i=1; i<=n; i++)
    {
        int x;
        in>>x;
        update(1, 1, n, i, x);
    }
    for(int i=1; i<=m; i++)
    {
        bool operatie;
        in>>operatie;
        switch(operatie)
        {
        case 0:
            {
                int t, v;
                in>>t>>v;
                update2(1, 1, n, t, v);
                break;
            }
        case 1:
            {
                int p, q;
                in>>p>>q;
                out << query(1, 1, n, p, q)<<'\n';
                break;
            }
        }
    }

    return 0;
}