求调，玄关！

#include <iostream>
#define int long long
using namespace std;

int n, m;

struct segment {
	int l;
	int r;
	int sum;
}t[800005];

void build(int p, int l, int r) {
	t[p].l = l;
	t[p].r = r;
	if(l == r) {
		t[p].sum = 0;
		return;
	}
	int mid = (l + r) / 2;
	build(p * 2, l, mid);
	build(p * 2 + 1, mid + 1, r);
	t[p].sum = t[p * 2].sum + t[p * 2 + 1].sum; 
}

void change(int p, int x, int y) {
	if(t[p].l == t[p].r) {
		t[p].sum += y; 
		return;
	}
	int mid = (t[p].l + t[p].r) / 2;
	if(x <= mid) change(p * 2, x, y);
	else change(p * 2 + 1, x, y);
	t[p].sum = t[p * 2].sum + t[p * 2 + 1].sum;
}

int query(int p, int l, int r) {
	if(l <= t[p].l && t[p].r <= r) {
		return t[p].sum;
	}
	int mid = (t[p].l + t[p].r) / 2;
	int ans = 0;
	if(l <= mid) ans += query(p * 2, l, mid); 
	if(r > mid)ans += query(p * 2 + 1, mid + 1, r);
	return ans;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	build(1, 1, n);
	while (m --) {
		char c;
		int a, b;
		cin >> c >> a >> b;
		if(c == 'x') {
			change(1, a, b);
		}else {
			cout << query(1, a, b) << '\n';
		}
	}
	return 0;
}