#include<bits/stdc++.h>
using namespace std;
#define int long long  
#define lowbit(x) (x&(-x))
int len ;
int tr[6300000+10];

#define endl '\n'
void insert(int pos,int val)
{
	while(pos <= len)
	{
		tr[pos] += val;
		pos += lowbit(pos);
	}
}
int query(int x)
{
	int res = 0;
	while(x)
	{
		res += tr[x];
		x -= lowbit(x);
	}
	return res;
}
int query(int l,int r)
{
	return query(r) - query(l-1);
}
const int N = 1e5+10;

struct query{
	int op,x,v,l,r;
}Q[N];

signed main (){
	std::ios::sync_with_stdio(false);  
	cin.tie(NULL); 
	cout.tie(NULL);
	int n,m;
	cin>>n>>m;
	vector<int> v;
	for(int i=1;i<=m;i++)
	{	
	
		cin>>Q[i].op;
		if(Q[i].op == 1)
		{	
			cin>>Q[i].x>>Q[i].v;
			int x = Q[i].x;
			while(x <= n)
			{
				v.push_back(x);
				x += lowbit(x);
			}
		}
		else 
		{
			cin>>Q[i].l>>Q[i].r;
		}
	}
	v.push_back(0);
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
	len = v.size() - 1;
	for(int i=1;i<=m;i++)
	{
		if(Q[i].op == 1)
		{	
			int x = Q[i].x;
			while(x <= n)
			{
			int y = lower_bound(v.begin(),v.end(),x) - v.begin();
			insert(y,Q[i].v);
			x += lowbit(x);
			
			}
		}
		else 
		{
			int l =lower_bound(v.begin(),v.end(),Q[i].l) - v.begin();
			int r = lower_bound(v.begin(),v.end(),Q[i].r) - v.begin();
			cout<<query(l,r)<<endl;
			
		}
	}
	
}