#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n ;
int m;
pair<ll,ll> p[100005];
int o[100005];
int main() {
    ios::sync_with_stdio(false) ;cin.tie(0) ;
    cin >> n >> m;
    vector<ll> v;
    for(int i = 1;i <= m;i++) {
        int op;cin >> op;
        cin >> p[i].first >> p[i].second ;
        o[i] = op;
        if(op == 1) {
            ll u = p[i].first ;
            while(u <= n) {
                v.push_back(u);
                u += (u&-u);
            }
        }
        else {
            v.push_back(p[i].first - 1);
            v.push_back(p[i].second);
        }
    }
    sort(v.begin() , v.end());
    v.erase(unique(v.begin() , v.end()) , v.end());
    // puts("OK");
    vector<ll> c(v.size() + 1);
    auto add = [&](int x,int v) {
        while(x < c.size()) {
            c[x] += v;
            x += (x & -x);
        }
    };
    auto qry = [&](int l,int r) {
        ll ans = 0;
        while(r) {
            ans += c[r] ;
            r -= (r & -r);
        }
        while(l) {
            ans -= c[l];
            l -= (l & -l);
        }
        return ans;
    };
    for(int i = 1;i <= m;i++) {
        if(o[i] == 1) {
            ll u = p[i].first ;
            while(u <= n) {
                int id = lower_bound(v.begin() , v.end() , u) - v.begin() + 1;
                add(id , p[i].second) ;
                u += (u & -u);
            }
        }
        else {
            ll l = lower_bound(v.begin() , v.end() , p[i].first - 1)- v.begin() + 1;
            ll r = lower_bound(v.begin() , v.end() , p[i].second)- v.begin() + 1;
            cout << qry(l,r) << '\n';
        }
    }
    return 0;
}