#include <stdio.h>
#include <fstream>
using namespace std;

#define in "aib.in"
#define out "aib.out"
#define dim 50001

int N, M, T;
int Arb[3*dim+66];
int A, B;
int C, S;

void Update(int,int,int);
void Query(int,int,int);

int main()
{
    memset(Arb,0,sizeof(Arb));
    freopen(in,"r",stdin);
    freopen(out,"w",stdout);
    
    scanf("%d%d", &N, &M);
    for ( int i = 1; i <= N; i++ )
    {
        scanf("%d", &T);
        A = i, B = T;
        Update(1,1,N);
    }
    
    for ( ; M; M-- )
    {
        scanf("%d%d%d", &C, &A, &B);
        if ( C == 0 )
        {
             S = 0;
             Query(1,1,N);
             
             printf("%d\n", S);
        }
        else
        {
            Update(1,1,N);
        }
    }
}

void Update(int nod, int left, int right)
{
     if ( left == right )
     {
          Arb[nod] += B;
          return;
     }     
     
     int div = (left+right)>>1;
     if ( A <= div ) Update(2*nod,left,div);
     else            Update(2*nod+1,div+1,right);
     
     Arb[nod] = Arb[2*nod] + Arb[2*nod+1];
}

void Query(int nod, int left, int right)
{
     if ( A <= left && right <= B )
     {
          //printf("%d %d %d\n", left, right, Arb[nod]);
          S += Arb[nod];
          return;
     }
     
     int div = (left+right)>>1;
     if ( A <= div ) Query(2*nod, left, div);
     if ( div < B )  Query(2*nod+1,div+1,right);
}