#include<bits/stdc++.h>
using namespace std;
#define int long long  
#define lowbit(x) (x&(-x))
map<int,int> tr;
int n;
#define endl '\n'
void insert(int pos,int val)
{
	while(pos <= n)
	{
		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);
}

signed main (){
	std::ios::sync_with_stdio(false);  
	cin.tie(NULL); 
	cout.tie(NULL);
	int m;
	cin>>n>>m;
	vector<int> v;
	for(int i=1;i<=m;i++)
	{	int op;
	
		cin>>op;
		if(op == 1)
		{	int x,v;
			cin>>x>>v;
			
		
			while(x <= n)
			{
				insert(x,v);
				x += lowbit(x);
			}
		}
		else 
		{
			int l,r;
			
			cin>>l>>r;
			cout<<query(l,r)<<endl;
			
		}
	}
}