写了树状数组板子，但是全部RE了，求调，谢谢大佬

#include <bits/stdc++.h>
using namespace std;

const int N = 5e5 + 5;
typedef long long ll;

ll c[N]; 
int n, m; 

ll lowbit(ll x) {
	return x & -x;
}

ll sum(ll x) {
	ll ans = 0;
	for (; x; x -= lowbit(x)) ans += c[x];
	return ans;
}

ll add(ll x, ll k) {
	for (; x <= n; x += lowbit(x)) c[x] += k;
} 

int main() {
	cin >> n >> m;
	for (ll i = 1; i <= n; i++) {
		ll x;
		cin >> x; 
		add(i, x);
	}
	while (m--) {
		int op;
		cin >> op;
		if (op == 1) {
			ll x, k;
			cin >> x >> k;
			add(x, k);
		}
		else {
			ll l, r;
			cin >> l >> r;
			cout << sum(r) - sum(l - 1) << endl;
		}
	} 
	return 0;
}