#include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;

template<class T>
struct Fenwick {
	int n;
	vector<T> sum;
	Fenwick(int _n = 0) {
		n = _n;
		sum.resize(n);
	}

	int lowbit(int x) {
		return x & (-x);
	}

	void update(int p, T k) {
		for (int i = p; i < n; i += lowbit(i)) {
			sum[i] += k;
		}
	}

	T prefixsum(int p) {
		T ans = 0;
		for (int i = p; i > 0; i -= lowbit(i)) {
			ans += sum[i];
		}
		return ans;
	}

	T rangesum(int l, int r) {
		return prefixsum(r) - prefixsum(l - 1);
	}
};

struct Info {
    int op;
    i64 x, y;
};

constexpr i64 N = 61;

i64 f(i64 x) {
    bool flag = false;
    for (i64 i = 0; i <= N; i++) {
        if (flag) {
            if (!((x >> i) & 1)) {
                x ^= 1LL << i;
                return x;
            }
        }

        if ((x >> i) & 1) {
            x ^= 1LL << i;
            flag = true;
        }
    }
    return 0;
}

void solve() {
    i64 n, m;
    cin >> n >> m;
    vector<i64> bin = { 0 };
    vector<Info> info(m);
    for (auto& [op, x, y] : info) {
        cin >> op >> x >> y;
        if (op == 1) {
            i64 cur = x;
            while (cur <= n) {
                bin.push_back(cur);
                cur = f(cur);
            }
        } else {
            bin.push_back(x - 1);
            bin.push_back(y);
        }
    }

    sort(bin.begin(), bin.end());
    int k = bin.size();
    Fenwick<i64> fw(k);

    for (auto& [op, x, y] : info) {
        if (op == 1) {
            i64 cur = x;
            while (cur <= n) {
                int pos = lower_bound(bin.begin(), bin.end(), cur) - bin.begin();
                fw.update(pos, y);
                cur = f(cur);
            }
        } else {
            int l = lower_bound(bin.begin(), bin.end(), x - 1) - bin.begin();
            int r = lower_bound(bin.begin(), bin.end(), y) - bin.begin();
            cout << fw.rangesum(l + 1, r) << "\n";
        }
    }
}

/*
8 6
1 1 1
1 3 2
1 5 3
1 7 4
2 1 5
2 4 8

1000000000000000000 2
1 1 1
2 1 1000000000000000000
*/

int main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);

    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}