#include<algorithm>
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<string>
#include<vector>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
int read(){
    int s=0,f=1;
    char _z=getchar();
    while(_z<'0'||_z>'9'){
        if(_z=='-')
        f=-1;
        _z=getchar();
    }
    while(_z>='0'&&_z<='9'){
        s=(s<<3)+(s<<1)+(_z-'0');
        _z=getchar();
    }
    return s*f;
}
const int N=1e4+10,L=1e3+10;
typedef long long ll;
struct name{
    ll a,b,c;
}na[N];
bool pd[N];
int main(){
    ll l=read(),q=read();
    for(ll a=-l;a<=l;a++){
        for(ll b=-l;b<=l;b++){
            ll c=0;
            while(a*a*a+b*b*b+c*c*c<=1e4){
                if(a*a*a+b*b*b+c*c*c>0&&!pd[a*a*a+b*b*b+c*c*c]){
                    pd[a*a*a+b*b*b+c*c*c]=true;
                    na[a*a*a+b*b*b+c*c*c]=(name){a,b,c};
                }
                c++;
            }
        }
    }
    while(q--){
        int x=read();
        if(pd[x]){
            printf("%lld %lld %lld\n",na[x].a,na[x].b,na[x].c);
        }else{
            printf("%lld %lld %lld\n",l+1,l+1,l+1);
        }
    }
    return 0;
}