#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());
int a[N];
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(){
	cin>>n>>m;
	int op,l,r,v;
	rep(i,1,m){
		cin>>op>>l;
		if(op==1){
			cin>>v;
			for(int j=l;j<=n;j+=lowbit(j)){
				modify(root,1,n,j,v);
			}
		}
		else{
			cin>>r;
			cout<<query(root,1,n,l,r)<<endl;
		}
	}
}

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