#include<algorithm>
#include<cstdio>
typedef long long ll;
const int maxm=15;
struct Data{
	ll a,b,c;
	Data(){}
	Data(const ll a,const ll b,const ll c):a(a),b(b),c(c){}
	void addl(const Data&l){
		a+=2*l.a+l.c;
		b+=l.b;
	}
	void addr(const Data&r){
		a+=2*r.a+r.c;
		b+=r.a+r.b;
	}
}res[maxm+1][1<<maxm];
int vis[maxm+1][1<<maxm],cur;
int n,q,a,d,m;
Data solve(const int dep,const int nextq,int m,const int d,const bool has_parent){
	if(dep==1)return Data(0,0,1);
	int size=(1<<dep)-1;
	bool memory=dep<=maxm&&has_parent&&nextq+m*d>=size;
	if(memory&&vis[dep][nextq]==cur)return res[dep][nextq];
	Data ans(0,0,0);
	int nownext=nextq,sonsize=size>>1;
	if(nownext<sonsize&&m>0){
		const int deltam=std::min(m,(sonsize-nownext-1)/d+1);
		ans.addl(solve(dep-1,nownext,deltam,d,true));
		m-=deltam;
		nownext+=deltam*d;
	}
	nownext-=sonsize;
	if(!has_parent){
		if(!nownext&&m>0){
			nownext+=d;
			m--;
			ans.a+=2;
			ans.b++;
		}
		nownext--;
	}
	if(nownext<sonsize&&m>0){
		const int deltam=std::min(m,(sonsize-nownext-1)/d+1);
		ans.addr(solve(dep-1,nownext,deltam,d,has_parent));
		m-=deltam;
		nownext+=deltam*d;
	}
	nownext-=sonsize;
	if(has_parent&&m>0)ans.c++;
	if(memory){
		vis[dep][nextq]=cur;
		res[dep][nextq]=ans;
	}
	return ans;
}
int main(){
	scanf("%d%d",&n,&q);
	for(cur=1;cur<=q;cur++){
		scanf("%d%d%d",&a,&d,&m);
		Data ans=solve(n,a-1,m,d,false);
		printf("%lld\n",ans.a+ans.b);
	}
	return 0;
}