#include <iostream>
#include <fstream>
using namespace std;

#ifdef LOCAL
#define fin cin
#define fout cout
#else
ifstream fin("datorii.in");
ofstream fout("datorii.out");
#endif

long long n;
long long aib[100001];

void update(long long p, long long a) {
    while (p <= n) {
        aib[p] += a;
        p += (p & -p);
    }
}

long long query(long long p) {
    long long a = 0;
    while (p > 0) {
        a += aib[p];
        p -= (p & -p);
    }
    return a;
}

int main() {
    long long m, t, a, b;
    fin >> n >> m;
    for (long long i=1; i<=n; i++) {
        fin >> a;
        update(i, a);
    }
    for (long long i=1; i<=m; i++) {
        fin >> t >> a >> b;
        if (t == 0) update(a, -b);
        else fout << query(b) - query(a - 1) << '\n';
    }
}