#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define all(x) (x).begin(), (x).end()
#define ls id << 1
#define rs id << 1 | 1

const int N = 1e5 * 120;
int tr[N<<2];
void up(int id){
	tr[id] = tr[ls] + tr[rs];
}
void add(int id, int l, int r, int x, int v){
	if(l == r){
		tr[id] += v;
		return;
	}
	int mid = l + r >> 1;
	if(x <= mid) add(ls, l, mid, x, v);
	else add(rs, mid + 1, r, x, v);
	up(id);
}
int query(int id, int l, int r, int ql, int qr) {
	if(ql <= l && r <= qr ) return tr[id];
	int mid = l + r >> 1;
	if(qr <= mid) return query(ls, l, mid, ql, qr);
	else if(ql > mid) return query(rs, mid + 1, r, ql, qr);
	else return query(ls, l, mid, ql, qr) + query(rs, mid + 1, r, ql, qr);
}

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

void solve(){
	int n, m;
	cin >> n >> m;
	vector<int>idx;
	vector<array<int,3>>qur(m);
	for(int i = 0;i < m;i++){
		for(int j = 0;j < 3;j++) cin >> qur[i][j];
		if(qur[i][0] == 1){
			int x = qur[i][1];
			while(x <= n){
				idx.push_back(x);
				x += lowbit(x);
			}
		}else{
			idx.push_back(qur[i][1]);
			idx.push_back(qur[i][2]);
		}
	}

	sort(all(idx));
	idx.erase(unique(all(idx)), idx.end());

	int mxn = idx.size()+5;

	for(auto [op, a, b] : qur) {
		if(op == 1){
			while(a <= n){
				int p = lower_bound(all(idx), a) - idx.begin() + 1;
				add(1, 1, mxn, p, b);
				a += lowbit(a);
			}
		}else{
			int l = lower_bound(all(idx), a) - idx.begin() + 1;
			int r = lower_bound(all(idx), b) - idx.begin() + 1;
			cout << query(1, 1, mxn, l, r) << endl;
		}
	}
}

signed main(){

	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) solve();

	return 0;
}