#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const long long N=1e18+10,M=1e5+10;
struct Operation
{
	long long type,val,l,r;
	vector<long long> add;
}op[M];
long long n,m;
ull F(ull x)
{
	int p=0;
	while(!((1ll<<p)&x and !(((1ll<<(p+1))&x))))p++;
	ull res=(1ll<<(p+1));
	for(int i=p+2;i<63;i++)
		if(x&(1ll<<i))res|=(1ll<<i);
	return res;
}
void solve(int l,int r)
{
	if(l==r)return ;
	int mid=l+r>>1;
	set<long long> num;
	num.insert(0);
	map<long long,long long>id;
	for(int i=l;i<=mid;i++)
		for(long long ai:op[i].add)
			num.insert(ai);
	int cnt=0;
	for(long long ai:num)
	{
		id[ai]=cnt;
		cnt++;
	}
	vector<long long>pre(num.size());
	for(int i=l;i<=mid;i++)
		for(long long ai:op[i].add)
			pre[id[ai]]+=op[i].val;
	for(int i=1;i<pre.size();i++)
		pre[i]+=pre[i-1];
	for(int i=mid+1;i<=r;i++)
	{
		if(op[i].type==2)
		{
			long long l=*prev(num.lower_bound(op[i].l));
			long long r=*prev(num.upper_bound(op[i].r));
			op[i].val+=pre[id[r]]-pre[id[l]];
		}
	}
	solve(l,mid);
	solve(mid+1,r);
}
int main()
{
	ios::sync_with_stdio(false);
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		cin>>op[i].type;
		if(op[i].type==1)
		{
			long long x;
			cin>>x>>op[i].val;
			while(x<=n)
			{
				op[i].add.push_back(x);
				x=F(x);
			}
		}
		else cin>>op[i].l>>op[i].r;
	}
	solve(1,m);
	for(int i=1;i<=m;i++)
		if(op[i].type==2)
			cout<<op[i].val<<"\n";
	return 0;
}