#include <cstdio>
#include <algorithm>
#include <time.h>
#include <queue>
#include <cmath>
#include <stack>
#include <fstream>
//#include <iostream>
#include <bitset>

using namespace std;
#define nl '\n'
#define all(v) v.begin(),v.end()
#define eb(x) emplace_back(x)
#define ull unsigned long long

template<class a>
//void print(a v) {
//    for_each(all(v), [](char x) { cout << x; });
//}

double logXBaseY(double X, double Y) {
    return log2(X) / log2(Y);
}
int nr,v[15001],q,temp;
inline int GetParent(int n){
    return n-(n&-n);
}
inline int GetNext(int n){
    return n+(n&-n);
}
inline void Update(int index,int val){
    while (index <= nr+1){
        v[index] += val;
        index = GetNext(index);
    }
}
inline int GetSum(int index){
    ull sum = 0;
    while(index){
        sum += v[index];
        index = GetParent(index);
    }
    return sum;
}
ifstream cin("datorii.in");
ofstream cout("datorii.out");
int main() {
    ios_base::sync_with_stdio(false);
    cin >> nr >> q;
    for(int i=0;i<nr;++i){
        cin >> temp;
        Update(i+1,temp);
    }
    int cod,first,second;
    for(int i=0;i<q;++i){
        cin >> cod >> first >> second;
        if(cod){
            cout << GetSum(second) - GetSum(first-1) << nl;
        }
        else {
            Update(first,-second);
        }
    }
    //    printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}