#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

#define DEBUG_VAR(x) { cerr << "* "#x" = " << x << endl; }
#define DEBUG_ARR(arr, l, r) \
{ \ 
    cerr << "* "#arr"[" << l << ", " << r << "]:"; \
    for(auto it = l, itr = r; it <= itr; it++) \
        cerr << arr[it] << ", "; \
    cerr << endl; \
}
#define DEBUG_FMT(...) { cerr << "* "; fprintf(stderr, __VA_ARGS__); }
#define DEBUG_HERE { DEBUG_FMT("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__); } 

using namespace std;
using LL = long long;
using ULL = unsigned long long;

LL n;
int m;

struct Bits
{
    unordered_map<LL, LL> c;

    inline LL lowbit(LL x) { return x & (-x); }
    void add(LL x, LL v)
    {
        for(LL i = 1; x <= n; x += lowbit(x), i++) {
            c[x] += i * v;
        }
    }
    LL sum(LL x)
    {
        if(x == 0) return 0;
        LL res = 0;
        for(; x > 0; x -= lowbit(x)) {
            if(c.count(x)) {
                res += c[x];
            }
        }
        return res;
    }   
} B;

int main()
{
    // freopen("1.in", "r", stdin);
    ios::sync_with_stdio(false); cin.tie(nullptr);

    cin >> n >> m;
    while(m--) {
        int opt; cin >> opt;
        if(opt == 1) {
            LL x, v;
            cin >> x >> v;
            B.add(x, v);
        } else {
            LL l, r;
            cin >> l >> r;
            cout << B.sum(r) - B.sum(l - 1) << endl;
        }
    }

    return 0;
}