#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e6+10;
ll n;
int cnt;
ll t[maxn*20];
unordered_map <ll,int> mp;
void Solve(){
    int m;
    cin>>n>>m;
    auto lowbit=[&](ll x)->ll{
        return x&(-x);
    };
    auto ask=[&](ll x)->ll{
        ll res=0;
        for(;x;x-=lowbit(x)){
            if(!mp[x])continue;
            res+=t[mp[x]];
        }
        return res;
    };
    while(m--){
        int op;
        ll x,y;
        cin>>op>>x>>y;
        if(op==1){
            for(int i=1;x<=n;x+=lowbit(x),i++){
                if(!mp[x])mp[x]=++cnt;
                t[mp[x]]+=i*y;
            }
        }   
        else {  
            cout<<ask(y)-ask(x-1)<<"\n";
        }
    }
}
signed main(){
    ios::sync_with_stdio(false),cin.tie(0);
    Solve();
    return 0;
}