#include<bits/stdc++.h>
#define Alex std::ios::sync_with_stdio(false),std::cin.tie(0),std::cout.tie(0);
#define int long long
#define double long double
const int QAQ = 0;
const double eps = 1e-10;
const int mod = 1e9 + 7;
const int N = 2e6 + 10;

inline int f(int x)
{
	if(x % 2 == 1) return x + 1;
	int t = 0;
	while(x % 2 == 0)
	{
		x = x / 2;
		t++;
	}
	return (x + 1) * (1LL << t);
}

struct node {
	int l, r;
	int add, sum;
} tr[N << 1];


int n, m, idx, root;

void pushup(int p) {
	tr[p].sum = tr[tr[p].l].sum + tr[tr[p].r].sum;
}

void pushdown(int p, int l, int r) {
	if(tr[p].add) {
		int mid = l + r >> 1;
		tr[tr[p].l].sum += (mid - l + 1) * tr[p].add, tr[tr[p].l].add += tr[p].add;
		tr[tr[p].r].sum += (r - mid) * tr[p].add, tr[tr[p].r].add += tr[p].add;
		tr[p].add = 0;
	}
}


void modify(int &p, int l, int r, int ql, int qr, int k) {
	if(!p) p = ++idx;
	if(l >= ql && r <= qr) {
		tr[p].sum += (r - l + 1) * k;
		tr[p].add += k;
		return ;
	}
	pushdown(p, l, r);
	int mid = l + r >> 1;
	if(ql <= mid) modify(tr[p].l, l, mid, ql, qr, k);
	if(qr > mid) modify(tr[p].r, mid + 1, r, ql, qr, k);
	pushup(p);
}

int query(int p, int l, int r, int ql, int qr) {
	if(l >= ql && r <= qr) { return tr[p].sum; }
	int mid = l + r >> 1;
	pushdown(p, l, r);
	int v = 0;
	if(ql <= mid) v = query(tr[p].l, l, mid, ql, qr);
	if(qr > mid) v += query(tr[p].r, mid + 1, r, ql, qr);
	return v;
}

signed main()
{
	Alex;
	int _;
	_ = 1;
	while(_--)
	{
		std::cin>>n>>m;
		std::map<int,int> ma;
		root = 0;
		for(int i = 1;i <= m;i++)
		{
			int op;
			std::cin>>op;
			if(op == 1)
			{
				int x,v;
				std::cin>>x>>v;
				while(x <= n)
				{
                    modify(root, 1, n, x, x, v);
					x = f(x);
				}
			}else
			{
				int l,r;
				int ans = 0;
				std::cin>>l>>r;
                ans = query(root, 1, n, l, r);
                std::cout<<ans<<'\n';
			}
		}
	}
	return QAQ;
}