#include <bits/stdc++.h>
using namespace std;
int a,b,c;
int l,q;
map <int,int> f;
int fun(int x) {
	int ls = -l,rs = l;
	while(ls <= rs) {
		int mid = (ls + rs) / 2;
		int now = mid * mid * mid;
		if(now < x) ls = mid + 1;
		else if(now == x) return mid;
		else rs = mid - 1;
	}
	return 0;
}
int main() {
	cin >> l >> q;
	for(int a = -l;a <= l;a ++) {
		for(int b = -l;b <= l;b ++) {
			int x = a * a * a + b * b * b;
			f[x] = a + l + 1;			
		} 
	}
	while(q --){
		int x;
		cin >> x;
		for(int c = 0;c <= l;c ++) {
			int m = f[x - c * c * c];
			if(m) {
				m = m - l - 1;
				int n = fun(x - c * c * c - m * m * m);
				cout << m << " " << n << " " << c << endl;
				x = 114514;
				break;
			}
		} 
		if(x != 114514)
		cout << l + 1 << " " << l + 1 << " " << l + 1 << endl;
	}
}