#include<iostream>
#include<cstring>
#include<vector>
#include<unordered_map>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    LL n; int m;
    cin >> n >> m;

    unordered_map<LL, LL> tr;
    tr.reserve(m * 60);

    auto lowbit = [&](LL x){
        return x & -x;
    };

    auto query = [&](LL x){
        LL ans = 0;
        while(x){
            if (tr.contains(x)) ans += tr[x];
            x -= lowbit(x);
        }
        return ans;
    };

    while(m--){
        int op; LL x, y;
        cin >> op >> x >> y;
        if (op == 1){
            int cnt = 0;
            while(x <= n){
                cnt += 1;
                tr[x] += 1LL * cnt * y;
                x += lowbit(x);
            }
        }
        else{
            cout << query(y) - query(x - 1) << '\n';
        }
    }

}