#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;
}
struct num{
	int a;
	int nm; 
}s[2001001];
int cnt;
bool cmp(num a,num b) {return a.nm < b.nm;}
int main() {
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	cin >> l >> q;
	for(int a = 0;a <= l;a ++) {
		for(int b = -l;b <= l;b ++) {
			int x = a * a * a + b * b * b;
			if(!f[x]){
				f[x] = 1;
				cnt ++;
				s[cnt].a = a;
				s[cnt].nm = x;	
			}
		} 
	}
	sort(s + 1,s + cnt + 1,cmp);
	while(q --){
		int x;
		cin >> x;
		int ls = 1;
		for(int c = l; c >= -l;c --){
			int now = x - c * c * c;
			int rs = cnt;
			while(ls <= rs) {
				int mid = (ls + rs) >> 1;
				if(s[mid].nm >= now) rs = mid - 1;
				else ls = mid + 1;
			}
			if(s[ls].nm == now) {
				cout << s[ls].a << " " << fun(s[ls].nm - s[ls].a * s[ls].a * s[ls].a) << " " << c << endl;
				ls = 1145141;
				break;
			}
		}
		if(ls != 1145141) cout << l + 1 << " " << l + 1 << " " << l + 1 << endl;
	}
}