#include <iostream>
#include <fstream>
using namespace std;

int arbint[60000];
ifstream f("datorii.in");
ofstream g("datorii.out");

void insert(int index, int start, int end, int poz, int val)
{
    if( start == end){
        arbint[index] = val;
        return;
    }
    int m = (start + end)/2;
    if( poz <= m)
        insert(index*2, start, m, poz,val);
    else
        insert(index*2+1, m+1, end,poz,val);

    arbint[index] = arbint[index*2] + arbint[index*2+1];
}

void update(int index, int start, int end, int poz, int val)
{
    if( start == end){
        arbint[index] -= val;
        return;
    }
    int m = (start + end)/2;
    if( poz <= m)
        update(index*2, start, m, poz,val);
    else
        update(index*2+1, m+1, end,poz,val);

    arbint[index] = arbint[index*2] + arbint[index*2+1];
}
int query(int index, int start, int end, int l, int r)
{
    if (start > r || end < l)
        return 0;
    if( start >= l && end  <= r)
        return arbint[index];
    int m = (start+end)/2;
    int left_side = query(index*2,start, m, l, r);
    int right_side = query(index*2+1,m+1, end, l, r);
    return left_side + right_side;
}

int main()
{
    int n, m,x,y,cod;
    f >> n >> m;
    for(int i = 1; i<= n; i++){
        f >> x;
        insert(1,1,n,i,x);
    }
    for(int i = 1; i<= m; i++)
    {
        f >> cod >> x >> y;
        if(cod == 0)
            update(1,1,n,x,y);
        else if(cod == 1)
            g << query(1,1,n,x,y)<< '\n';
    }
    return 0;
}