#include <bits/stdc++.h>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
const int NMAX = 15010;
int n,m,arb[4 * NMAX],ans;
void build(int nod, int st, int dr){
int mid;
if(st == dr)
f >> arb[nod];
else{
mid = (st + dr) / 2;
build(2 * nod, st, mid);
build(2 * nod + 1, mid + 1, dr);
arb[nod] = arb[2 * nod] + arb[2 * nod + 1];
}
}
void update(int nod, int st, int dr, int x, int y){
int mid;
if(st == dr){
arb[nod] -= y;
return;
}
mid = (st + dr) / 2;
if(x <= mid)
update(2 * nod, st, mid, x, y);
else
update(2 * nod + 1, mid + 1, dr, x, y);
arb[nod] = arb[2 * nod] + arb[2 * nod + 1];
}
void query(int nod, int st, int dr, int x, int y){
int mid;
if(st >= x && dr <= y)
ans += arb[nod];
else{
mid = (st + dr) / 2;
if(x <= mid)
query(2 * nod, st, mid, x, y);
if(mid + 1 <= y)
query(2 * nod + 1, mid + 1, dr, x, y);
}
}
int main(){
int i,x,y,q;
f >> n >> m;
build(1,1,n);
for(i = 1 ; i <= m ; i++){
f >> q >> x >> y;
if(q == 0){
update(1,1,n,x,y);
}else{
ans = 0;
query(1,1,n,x,y);
g << ans << "\n";
}
}
return 0;
}