#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second
 
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

LL f(LL x)
{
	LL y = __builtin_ctzll(x);
	return x + (1LL << y);
}

struct Fenwick
{
	int n;
	vector<LL> t;
	void init(int _n)
	{
		n = _n;
		t.clear();
		t.assign(n, 0);
	}
	void upd(int i, int x)
	{
		for (; i < n; i |= i + 1)
			t[i] += x;
	}
	LL query(int i)
	{
		LL ans = 0;
		for (; i >= 0; i = (i & (i + 1)) - 1)
			ans += t[i];
		return ans;
	}
};

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	LL n, m;
	cin >> n >> m;
	vector<tuple<int, LL, LL>> queries(m);
	for (auto& [op, a, b] : queries)
		cin >> op >> a >> b;
	vector<LL> vec;
	vec.reserve(60 * m);
	for (auto [op, a, b] : queries)
	{
		if (op == 1)
		{
			for (LL x = a; x <= n; x = f(x))
			{
				vec.PB(x);
			}
		}
	}
	sort(ALL(vec));
	vec.erase(unique(ALL(vec)), vec.end());
	Fenwick fw;
	fw.init(SZ(vec));
	for (auto [op, a, b] : queries)
	{
		if (op == 1)
		{
			for (LL x = a; x <= n; x = f(x))
			{
				int pos = lower_bound(ALL(vec), x) - vec.begin();
				fw.upd(pos, b);
			}
		}
		else
		{
			int le = lower_bound(ALL(vec), a) - vec.begin();
			int ri = upper_bound(ALL(vec), b) - vec.begin();
			cout << fw.query(ri - 1) - fw.query(le - 1) << "\n";
		}
	}
	return 0;
}