#include <cstdio>
#include <unordered_map>
using namespace std;
unordered_map<long long, pair<int, int> > mp;
long long l, q, x;
long long calc(long long x) {
    return x * x * x;
}
int main() {
    scanf("%lld%lld", &l, &q);
    for (int i = -l; i <= l; i++) {
        for (int j = -l; j <= l; j++) {
            mp[calc(i) + calc(j)] = {i, j};
        }
    }
    for (int i = 1; i <= q; i++) {
        scanf("%lld", &x);
        int a = l + 1, b = l + 1, c = l + 1;
        for (int j = -l; j <= l; j++) {
            long long sub = x - calc(j);
            if (mp.count(sub)) {
                a = mp[sub].second;
                b = mp[sub].first;
                c = j;
                break;
            }
        }
        printf("%d %d %d\n", a, b, c);
    }
    return 0;
}