#include <cstdio>
#include <vector>
using namespace std;
const int mod = 923239;
vector<pair<int, int> > v[1000010];
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++) {
            v[((calc(i) + calc(j)) % mod + mod) % mod].push_back({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)) % mod + mod) % mod;
            for (vector<pair<int, int> >::iterator it = v[sub].begin(); it != v[sub].end(); it++) {
                if (calc(it->first) + calc(it->second) + calc(j) == x) {
                    a = it->first;
                    b = j;
                    c = it->second;
                    break;
                }
            }
            if (a != l + 1) break;
        }
        printf("%d %d %d\n", a, b, c);
    }
    return 0;
}