#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("datorii.in");
ofstream fout("datorii.out");

int m, n;
int arborebinar[400100];
int start, finish;
int maxim;


void Update(int nod, int stanga, int dreapta, int val, int pos){
     if (stanga == dreapta){
          arborebinar[nod]+= val;
          return;
     }

     int div = (dreapta+stanga)/2;
     if (div >= pos) Update(2*nod,stanga,div,val, pos);
     else   Update(2*nod+1,div+1,dreapta,val, pos);


    arborebinar[nod] = arborebinar[2*nod + 1] + arborebinar[2*nod];
}



int Query(int nod, int stanga, int dreapta, int start, int finish){
     if ((stanga >= start) && (dreapta <= finish))
     {
          return arborebinar[nod];
     }

     int div = (stanga+dreapta) / 2;
     int sum1, sum2;
     sum1 = sum2 = 0;
     if (start <= div) sum1 = Query(2*nod, stanga, div, start, finish);
     if (finish > div) sum2 = Query(2*nod + 1,div +  1, dreapta, start, finish);
     return sum1 + sum2;
}

int main()
{
    int x, a, b;


    fin>>n>>m;
    for (int i = 1; i <= n; i++){
        fin>>x;
        Update(1,1,n, x, i);
    }

    for (int i = 1; i <= m; i++){
        fin>>x>>a>>b;
        if (x == 1){
             fout<<Query(1,1,n, a, b)<<"\n";
        }
        else{

            Update(1,1,n,-b, a);
        }
    }
    return 0;
}