#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define pb push_back
#define fi first
#define se second
#define sz(x) x.size()
#define lowbit(x) (x & (-x))
#define all(x) x.begin(), x.end()
#define inf 0x3f3f3f3f3f3f3f3f
#define int long long
using ll = long long;
using PII = pair<int, int>;
constexpr int N = 1e5 + 10;

using LD = long double;
mt19937_64 rnd(chrono::duration_cast<chrono::nanoseconds>(chrono::system_clock::now().time_since_epoch()).count());
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
namespace fastIO 
{ 
	#define BUF_SIZE 100000
	bool IOerror = 0; 	
	inline char nc(){ 		
		static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
		if(p1==pend){
		    p1=buf; 			
		    pend=buf+fread(buf,1,BUF_SIZE,stdin); 				
		} 		
		return (*p1++); 	
	} 	
	inline int in(){
		char c=nc();
		while(!isdigit(c))c=nc();
		int x=0;
		while(isdigit(c)){
			x=x*10+c-'0';
			c=nc();
		}
		return x;
	}
	#undef BUF_SIZE 
}; 
using namespace fastIO;
int n,m,k,_;
const int M=N*70;
int t[M],ls[M],rs[M];
int tot,root;

inline void up(int id){
	t[id]=t[ls[id]]+t[rs[id]];
}
void modify(int &id,int l,int r,int x,int v){
	if(!id) id=++tot;
	if(l==r){
		t[id]+=v; return;
	}
	int mid=l+r>>1;
	if(x<=mid) modify(ls[id],l,mid,x,v);
	else modify(rs[id],mid+1,r,x,v);
	up(id);
}
int query(int id,int l,int r,int ql,int qr){
	if(ql<=l&&r<=qr){
		return t[id];
	}
	int mid=l+r>>1;
	if(qr<=mid) return query(ls[id],l,mid,ql,qr);
	else if(ql>mid) return query(rs[id],mid+1,r,ql,qr);
	else return query(ls[id],l,mid,ql,qr)+query(rs[id],mid+1,r,ql,qr);
}
void solve(){
	n=in();
	m=in();
	int op,l,r,v;
	rep(i,1,m){
		op=in();
		l=in();
		v=in();
		if(op==1){
			for(int j=l;j<=n;j+=lowbit(j)){
				modify(root,1,n,j,v);
			}
		}
		else{
			cout<<query(root,1,n,l,v)<<endl;
		}
	}
}

signed main()
{
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    _ = 1;
    // cin >> _;
    while (_--)
    {
        solve();
        if (_) cout << endl;
    }
    return 0;
}