#include<cstdio>

using namespace std;

typedef long long LL;

const int N=;

LL tree[N],n,q,i,c,x,y;

inline void read(LL &x)

{

    x=; char ch=getchar(); int flag=;

    while (ch<''||ch>'') { if (ch=='-') flag=-; ch=getchar(); }

    while (ch>=''&&ch<='') x=x*+ch-'',ch=getchar();

    x*=flag;

}

void write(LL x)

{

    if (x/) write(x/);

    putchar(x%+'');

}

inline int lowbit(LL x) { return x&(-x); }

inline void add(LL x,LL y)

{

    while (x<=n)

    {

        tree[x]+=y;

        x+=lowbit(x);

    }

}

inline LL sum(LL x)

{

    LL tot=;

    while (x)

    {

        tot+=tree[x];

        x-=lowbit(x);

    }

    return tot;

}

int main()

{

    read(n); read(q);

    for (i=;i<=n;++i)

    read(x),add(i,x);

    while (q--)

    {

        read(c); read(x); read(y);

        if (c==) add(x,y); else write(sum(y)-sum(x-)),putchar('\n');

    }

    return ;

}