#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");

int v[15001], tree[61000];

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

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

int query(int nod, int st, int dr, int qleft, int qright)
{
    if(qleft<=st&&dr<=qright)
    {
        return tree[nod];
    }
    else
    {
        int mid=(st+dr)/2;
        if(qright<=mid)
        {
            return query(nod*2, st, mid, qleft, qright);
        }
        if(qleft>mid)
        {
            return query(2*nod+1, mid+1, dr, qleft, qright);
        }
        return query(nod*2, st, mid, qleft, qright)+query(2*nod+1, mid+1, dr, qleft, qright);
    }
}

int main()
{
    int n, m, i, x, y, op;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    build_tree(1, 1, n);
    for(i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
        if(op==1)
        {
            fout<<query(1, 1, n, x, y)<<"\n";
        }
        else
        {
            update(1, 1, n, x, y);
        }
    }
}