#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define ll long long int

struct fenwick_tree{
    vector<int> tr;
    int n;
    void build(vector<int> &arr){
        for(int i=1;i<=n;i++){
            tr[i]+=arr[i-1];
            if(i+(i&-i)<=n){
                tr[i+(i&-i)]+=tr[i];
            }
        }
        //debug(tr);
    }
    void update(int pos,int val){
        while(pos<=n){
            tr[pos]+=val;
            pos=pos+(pos&-pos);
        }
        //debug(tr);
    }
    int query(int l,int r){
        int s1=0;
        while(l>0){
            s1+=tr[l];
            l=l-(l&-l);
        }
        int s2=0;
        while(r>0){
            s2+=tr[r];
            r=r-(r&-r);
        }
        //debug(s1,s2);
        return s2-s1;
    }
};

int main(){
    ifstream in("datorii.in");
    ofstream out("datorii.out");
    int n,m;
    in>>n>>m;
    vector<int> a(n);
    for(int i=0;i<n;i++)in>>a[i];
    fenwick_tree ft;
    ft.tr.resize(n+1);
    ft.n=n;
    ft.build(a);
    int l,r,ty,val,pos;
    while(m--){
        in>>ty;
        if(ty){
            in>>l>>r;
            out<<ft.query(l-1,r)<<"\n";
        }
        else{
            in>>pos>>val;
            ft.update(pos,-val);
        }
    }
    return 0;
}