#include <cstdio>

using namespace std;
int aib[15010],n;
inline void upgrade(int poz,int val)
{
    for(; poz<=n; poz+=poz&-poz)
        aib[poz]+=val;
}
inline void downgrade(int poz,int val)
{
    for(; poz<=n; poz+=poz&-poz)
        aib[poz]-=val;
}
inline int query(int poz)
{
    int s=0;
    for(; poz>=1; poz-=poz&-poz)
        s+=aib[poz];
    return s;
}
int main()
{
    int m,i,x,op,y;
    freopen("datorii.in","r",stdin);
    freopen("datorii.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1; i<=n; i++)
    {
        scanf("%d",&x);
        upgrade(i,x);
    }
    for(i=1; i<=m; i++)
    {
        scanf("%d%d%d",&op,&x,&y);
        if(!op)
            downgrade(x,y);
        else
            printf("%d\n",query(y)-query(x-1));
    }
    return 0;
}