#include <fstream>
#define nmax 15004
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n,m,x,a,b,tree[nmax];
bool op;
void update (int pos,int val)
{
    while (pos<=n)
    {
        tree[pos]+=val;
        pos+=(pos&(-pos));
    }
}
int read (int pos)
{
    int sum=0;
    while (pos)
    {
        sum+=tree[pos];
        pos-=(pos&(-pos));
    }
    return sum;
}
int query (int p,int q)
{
    return read(q)-read(p-1);
}
int main()
{
    f>>n>>m;
    for (int i=1;i<=n;i++)
    {
        f>>x;
        update(i,x);
    }
    for (int i=1;i<=m;i++)
    {
        f>>op>>a>>b;
        if (!op) update(a,-b);
        else g<<query(a,b)<<'\n';
    }
    f.close();
    g.close();
}