本蒟蒻不知道为什么样例过不了，求大佬调，悬赏2关

#include <bits/stdc++.h>
using namespace std;
int a[500010], tree[2000010];
void buildTree(int k, int l, int r) {
	if (l == r) {
		tree[k] = a[l];
		return;
	}
	int mid = (l + r) >> 1;
	buildTree(2 * k, l, mid);
	buildTree(2 * k + 1, mid + 1, r);
	tree[k] = tree[2 * k] + tree[2 * k + 1];
}
int query(int k, int l, int r, int s, int t) {
	if (l == s && r == t)
		return tree[k];
	int mid = (l + r) >> 1;
	if (t <= mid)
		return query(2 * k, l, mid, s, t);
	if (s > mid)
		return query(2 * k + 1, mid + 1, r, s, t);
	return query(2 * k, l, mid, s, mid) + 
	query(2 * k + 1, mid + 1, r, mid + 1, t);
}
void update(int k, int l, int r, int x, int y) {
	tree[x] += y;
	if (l == r)
		return;
	int mid = (l + r) >> 1;
	if (x <= mid)
		update(2 * k, l, mid, x, y);
	else
		update(2 * k + 1, mid + 1, r, x, y);
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
		scanf("%d", a + i);
	buildTree(1, 1, n);
	while (m--) {
		int op, x;
		scanf("%d%d", &op, &x);
		if (op == 1) {
			int k;
			scanf("%d", &k);
			for (int i = 1; i <= n; i++)
				printf("%d ", tree[i]);
			puts("");
			update(1, 1, n, x, k);
		} else {
			int y;
			scanf("%d", &y);
			
			printf("%d\n", query(1, 1, n, x, y));
		}
	}
	return 0;
}