#include <bits/stdc++.h>


using namespace std;

const int N = 1e5 + 10;
int n, m, a[N], t[N << 4];

void build(int x, int l, int r) {
    if (l == r) return t[x] = a[l], void();
    int mid = (l + r) >> 1;
    build(x << 1, l, mid);
    build(x << 1 | 1, mid + 1, r);
    t[x] = t[x << 1] + t[x << 1 | 1];
}

void update(int p, int l, int r, int x, int y) {
    if (l == r) return t[p] += y, void();
    int mid = (l + r) >> 1;
    if (x > mid) update(p << 1 | 1, mid + 1, r, x, y);
    else update(p << 1, l, mid, x, y);
    t[p] = t[p << 1] + t[p << 1 | 1];
}

int query(int p, int l, int r, int x, int y) {
    if (l == x && r == y) return t[p];
    int mid = (l + r) >> 1;
    if (y <= mid) return query(p << 1, l, mid, x, y);
    else if (x > mid) return query(p << 1 | 1, mid + 1, r, x, y);
    return query(p << 1, l, mid, x, mid) + query(p << 1 | 1, mid + 1, r, mid + 1, y);
}

signed main() {
    freopen("P3374_2.in", "r", stdin);
    freopen("P3374_2.out", "w", stdout);
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    build(1, 1, n);
    while (m--) {
        int op, x, y;
        cin >> op >> x >> y;
        if (op == 1) update(1, 1, n, x, y);
        else cout << query(1, 1, n, x, y) << '\n';
    }
    return 0;
}