#include<fstream>
using namespace std;
int n, m, i, x, y, t, a, b, p, u;
int v[15003];
ifstream fin("datorii.in");
ofstream fout("datorii.out");
void update(int x, int val){
    for(; x <= n; x += (x & -x)){
        v[x] += val;
    }
}
int query(int x){
    int sum = 0;
    for(; x >= 1; x -= (x & -x)){
        sum += v[x];
    }
    return sum;
}
int binar(int x){
    int p, u, mid;
    p = 1;
    u = n;
    while(p <= u){
        mid = (p + u) / 2;
        if(query(mid) >= x){
            u = mid - 1;
        }
        else{
            p = mid + 1;
        }
    }
    return p;
}
int main(){
   fin>> n >> m;
   for(i = 1; i <= n; i++){
      fin>> x;
      update(i, x);
   }
   for(i = 1; i <= m; i++){
       fin>> t >> a >> b;
       if(t == 0){
            update(a, -b);
       }
       else{
            p = query(a - 1);
            u = query(b);
            fout<< u - p <<"\n";
       }
   }
   return 0;
}