#include <bits/stdc++.h> 
using namespace std;
const int N = 1e7 + 10; 
#define int long long
#define all(x) (x).begin(), (x).end()
#define peace ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define bcount(t) __builtin_popcount(t)
#define lowbit(x) (x&(-x))
const int inf = 1e18; 


int tree[N];
int a[N]; 
int n;

void add_dandian(int x,int k)
{
	for(int i=x;i<=n;i+=lowbit(i))
	tree[i]+=k;
}

void add(int pos, int val){ // tree为树状数组
	while(pos <= n) // 不能越界
	{
		tree[pos] += val;
		pos += lowbit(pos);
	}
}

int query1(int x){ // a[1]..a[x]的和
	int ans = 0;
	while (x >= 1){
		ans = ans + tree[x];
		x = x - lowbit(x);
	} 
	return ans;
}

int query(int l, int r){ // 前缀相减
	return query1(r) - query1(l-1);//求的是(l,r)里面的所有数的和
}

int f(int x){
	return x + lowbit(x);
}

void solve(){
	int q;
	cin >> n >> q;
	vector<int> op(q), opa(q), opb(q);
	vector<int> nums;
	for(int i = 0	; i < q; i++){
		cin >> op[i] >> opa[i] >> opb[i];
		if(op[i] == 1){
//			遍历算出所有x的f（x），在离散数组中插入，如果原来有的话就直接加num
			int x = opa[i], v = opb[i];
			for(int j = x; j <= n; j = f(j)){
				nums.push_back(j);
//				cerr << j << endl;
			}
		}
	}
	sort(all(nums));
	nums.erase(unique(all(nums)), nums.end());
//	for(auto it:nums){
//		cout << it << " ";
//	}
//	cout << endl;
	
	int nn = n;
	n = nums.size();
	int ind;
	for(int i=1;i<=n;i++){
		a[i] = 0;
		add(i, 0);
	}
	
//	cout << query(1,8);
	for(int i = 0; i < q; i++){
		if(op[i] == 1){
			int x = opa[i], v = opb[i];
			for(int j = x; j <= nn; j = f(j)){
				ind = lower_bound(all(nums),j) - nums.begin() + 1;
//				cerr << ind << " " << v << endl;
				add(ind,v);
				
//				cerr << query(ind,ind) << endl;
			}
			
		}else{
			 
			int l = opa[i], r = opb[i];
			l = lower_bound(all(nums),l) - nums.begin() + 1;
			r = lower_bound(all(nums),r) - nums.begin() + 1;
//			cerr << l << r;
			cout << query(l, r) << endl;	
		}
	}

//	for(int i = 1; i < 1000; i++){
//		cout << f(i) << endl;
//	}

	
}
 
signed main(){
	peace;
	int T = 1;
//	cin >> T;
	while(T--){
		solve();
	} 
	return 0;
}