#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define f first
#define s second
using namespace std;
using ll = long long;
using pii = pair <int, int>;
const int N = 1e5 + 5;
ll f(ll x) {
    for (ll i = 0; ; ++i) {
        if (((x >> i) & 1) && !((x >> (i + 1)) & 1)) {
            return x - (1ll << i) + (1ll << (i + 1));
        }
        if ((x >> i) & 1)
            x -= (1 << i);
    }
}
ll n, t[61 * N];
int m;
vector <ll> vals;
int bruh;
void add(int x, int v) {
    for ( ; x < sz(vals); x |= x + 1) {
        t[x] += v;
        //assert(++bruh <= 2e8);
    }
}
ll get(int x) {
    ll ans = 0;
    for (; x >= 0; x &= x + 1, --x) {
        ans += t[x];
    }
    return ans;
}
int tp[N], v[N];
ll l[N], r[N], x[N];
int main() {
    ios :: sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        cin >> tp[i];
        if (tp[i] & 1) {
            cin >> x[i] >> v[i];
            ll cur = x[i];
            while (cur <= n) {
                assert(++bruh <= 2e8);
                vals.pb(cur);
                cur = f(cur);
            }
        } else {
            cin >> l[i] >> r[i];
        }
    }
    sort(all(vals));
    vals.erase(unique(all(vals)), vals.end());
    for (int i = 0; i < m; ++i) {
        if (tp[i] & 1) {
            while (x[i] <= n) {
                int p = lower_bound(all(vals), x[i]) - vals.begin();
                add(p, v[i]);
                x[i] = f(x[i]);
            }
        } 
        
        else {
            int R = upper_bound(all(vals), r[i]) - vals.begin() - 1;
            int L = upper_bound(all(vals), l[i] - 1) - vals.begin() - 1;
            cout << get(R) - get(L) << '\n';
        }
    }
    return 0;
}