子数列连续和

#include<bits/stdc++.h>
#include<queue>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<iostream>
#define REP(i, a, b) for(int i = (a); i <= (b); ++ i)
#define REP(j, a, b) for(int j = (a); j <= (b); ++ j)
#define PER(i, a, b) for(int i = (a); i >= (b); -- i)
using namespace std;
const int maxn = 1e7 + 5;
int n, k,p[maxn],m,x;
int lowbit(int a) {
    return a & (-a);
}
void add(int pos,int w) {
    while (pos <= n) {
        p[pos] += w, pos += lowbit(pos);
    }
}
int sum(int pos) {
    int tot=0;
    while (pos) {
        tot += p[pos];
        pos -= lowbit(pos);
    }
    return tot;
}
int main(){
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> x;
        add(i, x);
    }
    while (m--) {
        int x, u, v;
        cin >> x >> u >> v;
        if (x) {
            add(u, v);
        }
        else {
            cout << sum(v) - sum(u - 1) << endl;
        }
    }
}