#include <bits/stdc++.h>
#include <unordered_map>
#include <map>

using namespace std;

ifstream fin("datorii.in");
ofstream fout("datorii.out");
//-----------------------------------------
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vll vector<long long>
#define mii map<int, int>
#define si set<int>
#define sc set<char>
//-----------------------------------------
#define f(i,s,e) for(int i=s;i<=e;++i)
#define nf(i,s,e) for(i=s;i<e;++i)
#define rf(i,e,s) for(i=e;i>=s;--i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sp <<" "
//------------------------------------------
const int NMAX = 15e3 + 5;
const int KMAX = 1e1 + 5;
const int MOD = 666013;
const int INF = 0x3f3f3f3f;
//------------------------------------------
int ft[NMAX], n, m;
//------------------------------------------
void update(int pos,int x) {
    for (int i = pos; i <= n; i += i & -i)
        ft[i] += x;
}
void read() {
    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        int x;
        fin >> x;
        update(i, x);
    }
}
int query(int x) {
    int s = 0;
    for (int i = x; i > 0; i -= i & -i)
        s += ft[i];
    return s;
}
void solve() {
    for (int i = 1; i <= m; ++i) {
        int x, y, z;
        fin >> x >> y >> z;
        if (x == 0)
            update(y, -z);
        else
            fout << query(z) - query(y - 1) << "\n";
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    read();
    solve();
    return 0;
}