#include <cstdio>
using namespace std;
int aib[15005],n;
inline void update1(int x,int val)
{
    for( ; x<=n; x+=x&-x)
        aib[x]+=val;
}
inline void update2(int x,int val)
{
    for( ; x<=n; x+=x&-x)
        aib[x]-=val;
}
inline int query(int x)
{
    int s=0;
    for( ; x>=1; x-=x&-x)
        s+=aib[x];
    return s;
}
int main()
{
    int m,a,b,c,p;
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(register int i=1; i<=n; ++i)
    {
        scanf("%d",&p);
        update1(i,p);
    }
    for(register int i=1; i<=m; ++i)
    {
        scanf("%d%d%d",&a,&b,&c);
        if (a==1)
            printf("%d\n",query(c)-query(b-1));
        else
            update2(b,c);
    }
    return 0;
}