#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int aib[100002], n, m;

ifstream fin("datorii.in");
ofstream fout("datorii.out");

void update(int poz, int val) {
    for (int i = poz; i <= n; i += (i & (-i)))
        aib[i] = aib[i] + val;
}

int sum(int poz) {
    int s = 0;
    for (int i = poz; i >= 1; i -= (i & (-i)))
        s += aib[i];
    return s;
}

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