struct Fenwick {
    vector<ll> t;
    int n;
    Fenwick(int n_) {
        n = n_;
        t.assign(n + 1, 0);
    }

    void change(int x, int y) {
        for (; x <= n; x += x & -x) {
            t[x] += y;
        }
    }

    ll query(int x) {
        ll res = 0;
        for (; x > 0; x -= x & -x) {
            res += t[x];
        }
        return res;
    }

    ll query(int l, int r) {
        return query(r) - query(l - 1);
    }
};
void solve() {
    int n, q;
    cin >> n >> q;
    Fenwick t(n);
    for (int i = 1; i <= n; i++) {
        int x; cin >> x;
        t.change(i, x);
    }
    while (q--) {
        int o, x, y;
        cin >> o >> x >> y;
        if (o == 1) {
            t.change(x, y);
        } else {
            cout << t.query(x, y) << '\n';
        }
    }
}