#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=(k);++i)
#define MAXN 1000005
typedef long long ll;
ll n,m,cnt,opt[MAXN],a[MAXN],b[MAXN],val[MAXN];
namespace bit{
	ll tree[MAXN];
	inline void add(ll x,ll y){
		for(;x<=cnt;x+=x&-x) tree[x]+=y;
	}
	inline ll calc(ll x){
		ll ret=0;
		for(;x;x-=x&-x) ret+=tree[x];
		return ret;
	}
}
inline void ins(ll x,ll y){
	for(;x<=n;x+=x&-x) bit::add(std::lower_bound(val+1,val+cnt+1,x)-val,y);
}
inline ll query(ll l,ll r){
	ll x=std::lower_bound(val+1,val+cnt+1,l-1)-val;
	ll y=std::lower_bound(val+1,val+cnt+1,r)-val;
	return bit::calc(y)-bit::calc(x);
}
int main(){
	std::ios::sync_with_stdio(0);
	std::cin.tie(0),std::cout.tie(0);
	std::cin>>n>>m;
	rep(i,1,m){
		std::cin>>opt[i]>>a[i]>>b[i];
		if(opt[i]==2) val[++cnt]=a[i]-1,val[++cnt]=b[i];
	}
	std::sort(val+1,val+cnt+1);
	cnt=std::unique(val+1,val+cnt+1)-val-1;
	rep(i,1,m){
		if(opt[i]==1) ins(a[i],b[i]);
		else printf("%lld\n",query(a[i],b[i]));
	}
}