#include <bits/stdc++.h>
#define NM 15010
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int tree[4*NM], v[NM],n,m,i,t,x,y;
void build(int node, int left, int right)
{
    if(left==right)
    {
        tree[node]=v[left];
        return;
    }
    int mij=(left+right)/2;
    build(2*node,left,mij);
    build(2*node+1,mij+1,right);
    tree[node]=tree[2*node]+tree[2*node+1];
}
void update(int node, int left, int right, int pos, int val)
{
    if(left==right)
    {
        tree[node]-=val;
        return ;
    }
    int mij=(left+right)/2;
    if(pos<=mij)
        update(2*node,left,mij,pos,val);
    else
        update(2*node+1,mij+1,right,pos,val);
    tree[node]=tree[2*node]+tree[2*node+1];
}
int query(int node, int left, int right, int a, int b)
{
    if(a<=left && right<=b)
        return tree[node];
    int mij=(left+right)/2, ans1=0,ans2=0;
    if(a<=mij)
        ans1=query(2*node,left,mij,a,b);
    if(mij<b)
        ans2=query(2*node+1,mij+1,right,a,b);
    return ans1+ans2;
}
int main()
{
    fin>>n>>m;
    for(i=1; i<=n; i++)
        fin>>v[i];
    build(1,1,n);
    for(i=1; i<=m; i++)
    {
        fin>>t>>x>>y;
        if(t==0)
            update(1,1,n,x,y);
        else
            fout<<query(1,1,n,x,y)<<'\n';
    }
    return 0;
}