#include <cstdio>
using namespace std;

int arb[100001],n,pos,val,a,b;

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

int querry(int node,int st,int dr)
{
int mid,v1=0,v2=0;
if (a<=st && dr<=b) return arb[node];
mid=(st+dr)/2;
if (a<=mid) v1=querry(2*node,st,mid);
if (b>mid) v2=querry(2*node+1,mid+1,dr);
return v1+v2;
}

int main()
{
int m,op;
freopen("datorii.in","r",stdin);
freopen("datorii.out","w",stdout);
scanf("%d%d",&n,&m);
for (int i=1;i<=n;++i)
    {
    scanf("%d",&val);
    pos=i;
    update(1,1,n);
    }
while (m--)
    {
    scanf("%d%d%d",&op,&a,&b);
    if (!op) {
             val=-b;pos=a;
             update(1,1,n);
             }
    if (op) printf("%d\n",querry(1,1,n));

    }
return 0;
}