#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);i++)
#define foR(i,j,k) for(int i=(j);i>=(k);i--) 
#define vi vector<int>
#define pb push_back
#define pii pair<int,int> 
#define mkp make_pair
#define SZ(x) ((int)x.size())
#define int long long
using namespace std;
inline int read() {
	char c;int res=0;bool flag=0;
	while(c=getchar(),c<48)(c=='-')&&(flag=1);
	do res=(res<<3)+(res<<1)+(c^48);
	while(c=getchar(),c>47);
	flag&&(res=-res); return res; 
}
const int MN=1e5+5; 
int n,m,c[MN*61];
int qry(int x) {
	int ans=0; 
	for(;x;x-=x&-x) ans+=c[x]; 	
	return ans; 
}
int OP[MN],X[MN],Y[MN],disc[MN*61],t; 
void works() {
	n=read(),m=read();
	For(i,1,m) {
		OP[i]=read(),X[i]=read(),Y[i]=read();
		if(OP[i]==1) {
			for(int x=X[i];x<=n;x+=x&-x) 
				disc[++t]=x;
		}
	}
	sort(disc+1,disc+1+t); t=unique(disc+1,disc+1+t)-disc-1; 
//	cerr<<t<<' '<<disc[t]<<endl;
	For(i,1,m) {
		if(OP[i]==1) {
			for(int x=X[i];x<=n;x+=x&-x) {
//				cerr<<x<<endl;
				int zz=lower_bound(disc+1,disc+1+t,x)-disc;
				for(int y=zz;y<=t;y+=y&-y) c[y]+=Y[i];  
			}
		} else {
			Y[i]=upper_bound(disc+1,disc+1+t,Y[i])-disc-1; 
			X[i]=lower_bound(disc+1,disc+1+t,X[i])-disc-1; 
			printf("%lld\n",qry(Y[i])-qry(X[i])); 	
		}
	}
}
signed main() {
	#ifdef wasa855
		freopen("pro.in","r",stdin); 
		freopen("pro.out","w",stdout); 
	#endif
	int T=1; 
	while(T--) {
		works(); 	
	}
	return 0; 	
}