#include <bits/stdc++.h>

using namespace std;

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

int n, m, a, b;
int aib[150050];

bool cod;

void update (int poz, int val){
    for (; poz<=n; poz += (poz&(-poz))){
        aib[poz] += val;
    }
}

int query (int poz){
    int rez = 0;
    for (; poz>0; poz -= (poz&(-poz))){
        rez += aib[poz];
    }
    return rez;
}

int main(){
    fin >> n >> m;
    for (int i=1; i<=n; i++){
        fin >> a;
        update (i, a);
    }
    for (int i=1; i<=m; i++){
        fin >> cod >> a >> b;
        if (cod == 1){
            fout << query (b) - query (a-1) << "\n";
        }
        else if (cod == 0){
            update (a, -b);
        }
    }
    return 0;
}