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

const int N = (1 << 15) + 5;

typedef long long LL;

int pk[2][N], pb[2][N];
int cnt;

//rt_now = k * rt + b
void dfs1(int dep, int tp, int k, int b, int id){
	if(dep <= 1)return ;
	
	dfs1(dep - 1, 1, k << 1, b << 1, id);
	cnt ++, pk[id][cnt] = k, pb[id][cnt] = b;
	if(tp == 1){
		dfs1(dep - 1, 1, k << 1, b << 1 | 1, id);
		cnt ++, pk[id][cnt] = k, pb[id][cnt] = b;
	}
	else {
		cnt ++, pk[id][cnt] = k << 1, pb[id][cnt] = b << 1 | 1;
		dfs1(dep - 1, 0, k << 1, b << 1 | 1, id);
	}
}

LL pK[2][N], pB[2][N];

int HF = 0;

LL dfs(int dep, int tp, int rt, int a, int d){
    if(a < 0)return 0;

	if(dep <= HF) return pK[tp][a] * rt + pB[tp][a];
	
	LL ans = 0;
	
	int szl = (1 << (dep - 1)) - 2;
	if(a <= szl)return dfs(dep - 1, 1, rt << 1, a, d);
	else {
        int t = a - (a - szl + d - 1) / d * d;
        ans += dfs(dep - 1, 1, rt << 1, t, d);
	}
	if((szl + 1) % d == a % d)ans += rt;
	
	if(tp == 1){
		if(szl + 2 <= a)ans += dfs(dep - 1, 1, rt << 1 | 1, a - szl - 1 - (a >= 2 * szl + 2) * d, d);
		if((2 * szl + 2) <= a && (2 * szl + 2) % d == a % d)ans += rt;
	}
	else {
		if(szl + 2 <= a && (szl + 2) % d == a % d)ans += rt << 1 | 1;
		if(szl + 3 <= a)ans += dfs(dep - 1, 0, rt << 1 | 1, a - szl - 2, d);
	}
	
	return ans;
}

int a, m, d;

int main(){
	int n, q;
	scanf("%d%d", &n, &q);
	HF = n / 2;
	cnt = 0, dfs1(HF, 1, 1, 0, 1);
	cnt = 0, dfs1(HF, 0, 1, 0, 0);

	for(int TT = 1; TT <= q; TT ++){
		scanf("%d%d%d", &a, &d, &m);

		for(int i = 0; i <= 1; i ++) for(int j = 1; j <= cnt + 1; j ++){
            pK[i][j] = ((j > d) ? pK[i][j - d] : 0) + pk[i][j];
            pB[i][j] = ((j > d) ? pB[i][j - d] : 0) + pb[i][j];
        }

		printf("%lld\n", dfs(n, 0, 1, a + (m - 1) * d, d)   
		    - ((a > d) ? dfs(n, 0, 1, a - d, d) : 0));
	}
}