#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;

const int NMAX = 15010;

int N, M, X, Aib[NMAX], Type, A, B;

int LSB(int X)
{
    return (X & (X - 1)) ^ X;
}

void Update(int Pos, int Val)
{
    for(; Pos <= N; Pos += LSB(Pos))
        Aib[Pos] += Val;
}

int Query(int Pos)
{
    int Nr = 0;
    for(; Pos; Pos -= LSB(Pos))
        Nr += Aib[Pos];
    return Nr;
}

int main()
{
    freopen("datorii.in", "r", stdin);
    freopen("datorii.out", "w", stdout);

    scanf("%i %i", &N, &M);
    for(int i = 1; i <= N; ++ i)
    {
        scanf("%i", &X);
        Update(i, X);
    }

    for(; M; M --)
    {
        scanf("%i %i %i", &Type, &A, &B);
        if(Type == 0) Update(A, -B);
        else printf("%i\n", Query(B) - Query(A - 1));
    }
}