#include <iostream>
#include <stdio.h>
using namespace std;
int n,m;
int arbori[100100];

class arbori_indexati_binari
{
  public:
        void creat(int i , int x);
        int find_sume(int x , int y);
};



int arbori_indexati_binari::find_sume(int x , int y)
{
    int sume = 0;
    for(y = y-(y^(y-1)&y)+1 ; y > 0 ; y -=(y^(y-1)&y))
        sume += arbori[y];
    int dif = 0;
    for(x = x - (x^(x-1))&x ; x > 0 ; x -=(x^(x-1)&x))
        dif -=arbori[x];
   return sume + dif;
}

void arbori_indexati_binari :: creat(int i , int x)
{
    for(int j = i - ((i^(i - 1))&i) + 1; j <= n ; j+=(j^(j-1))&j)
    {
        i = j;
        arbori[i] += x;
    }
}



void read()
{
    int nr,task;
    arbori_indexati_binari object;
    scanf("%d %d",&n,&m);
    for(int i = 0 ; i < n ; i++)
        {
            scanf("%d ",&nr);
            object.creat(i+1,nr);
           // printf("%d\n",arbori[i+1]);
        }
    for(int i = 0 ; i < m ; i++)
    {
        int task,a,b;
        scanf("%d",&task);
        if(task == 0 )
        {scanf("%d %d ",&a,&b);
         object.creat(a,b);}
         if(task == 1)
         {
             scanf("%d %d",&a,&b);
             printf("%d\n",object.find_sume(a,b));
         }
         if(task == 2)
         {
             scanf("%d",&a);
         }
    }

}





int main()
{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    read();
    return 0;
}