Fenwick Tree Template

void upd(int i, int v) {
    for(; i<mv; i+=i&-i) bit[i] += v;
}

int qry(int i) {
    int r = 0;
    for(; i>0; i-=i&-i) r += bit[i];
    return r;
}