#include <bits/stdc++.h>
using namespace std;

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


#define cin fin
#define cout fout
/*
*/
const int NMAX=(2<<16);
int x, n, m, caz, a, b, val;
int arbore[NMAX];

void update_(int left, int right, int pos, int val, int nod)
{
    if(left==right)
    {
        arbore[nod]=val;
        return;
    }
    int mij=(left+right)/2;
    if(pos<=mij)
        update_(left, mij, pos, val, 2*nod);
    else
        update_(mij+1, right, pos, val, 2*nod+1);
    arbore[nod]=arbore[2*nod]+arbore[2*nod+1];
}

void update(int left, int right, int pos, int val, int nod)
{
    if(left==right)
    {
        arbore[nod]-=val;
        return;
    }
    int mij=(left+right)/2;
    if(pos<=mij)
        update(left, mij, pos, val, 2*nod);
    else
        update(mij+1, right, pos, val, 2*nod+1);
    arbore[nod]=arbore[2*nod]+arbore[2*nod+1];
}


void query(int &val, int left, int right, int start, int finish, int nod)
{
    if(start<=left&&right<=finish)
    {
        val+=arbore[nod];
        return;
    }
    int mij=(left+right)/2;
    if(start<=mij)
        query(val, left, mij, start, finish, 2*nod);
    if(mij<finish)
        query(val, mij+1, right, start, finish, 2*nod+1);
}


int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        cin>>x;
        update_(1,n,i,x,1);
    }
    for(int i=1; i<=m; i++)
    {
        cin>>caz>>a>>b;
        if(caz)
        {
            val=0;
            query(val,1,n,a,b,1);
            cout<<val<<"\n";
        }
        else
            update(1,n,a,b,1);
    }





    return 0;
}