#include <cstdio>
#include <algorithm>
#define N 1<<18+10
using namespace std;
int n,m,i,ARB[N],z,a,b,cod;
int query(int nod,int x,int y)
{
    if(x>b||y<a)
        return 0;
    if(x>=a&&y<=b)
        return ARB[nod];
    return query(2*nod,x,(x+y)/2)+query(2*nod+1,(x+y)/2+1,y);
}
int main()
{
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(z=1;z<=n;z<<=1);
    z--;
    for(i=1;i<=n;i++)
        scanf("%d",&ARB[i+z]);
    for(i=z;i>=1;i--)
        ARB[i]=ARB[2*i]+ARB[2*i+1];
    for(;m;m--)
    {
        scanf("%d%d%d",&cod,&a,&b);
        if(!cod)
        {
            a+=z;
            ARB[a]-=b;
            for(i=a>>1;i;i>>=1)
                ARB[i]=ARB[2*i]+ARB[2*i+1];
        }
        else
            printf("%d\n",query(1,1,z+1));
    }
    return 0;
}