#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    vector<int> p = {1, 11, 111, 1111};
    const int L = 50;
    vector<vector<int>> G(vec_sum(p) * L + 1);
    rep(a, 0, L) rep(b, 0, L) rep(c, 0, L) rep(d, 0, L){
        vector<int> q = {a, b, c, d};
        if (vec_sum(q) <= 2 * vec_max(q)) continue;
        int sum = 0;
        rep(i, 0, 4) sum += p[i] * q[i];
        G[sum] = q;
    }
    int T;
    cin >> T;
    vector<ll> X = {13, 9, 9, -1};
    while (T--){
        ll N;
        cin >> N;
        if (N % 8){
            cout << "-1\n";
            continue;
        }
        N /= 8;
        if (N < (int)G.size()){
            if (G[N].empty()) cout << "-1\n";
            else vec_out(G[N]);
            continue;
        }
        vector<ll> q(4);
        for (int i = 3; i >= 0; i--){
            q[i] = N / p[i];
            N %= p[i];
        }
        ll l = -1, r = q[3];
        while (r - l > 1){
            ll mid = (l + r) / 2;
            vector<ll> tmp(3);
            rep(i, 0, 3) tmp[i] = q[i] + X[i] * mid;
            if (vec_sum(tmp) <= q[3] - mid) l = mid;
            else r = mid;
        }
        rep(i, 0, 4) q[i] += X[i] * r;
        vec_out(q);
        assert(vec_max(q) * 2 < vec_sum(q));
        if (false){
            ll tmp = 0;
            rep(i, 0, 4) tmp += q[i] * p[i];
            cout << tmp * 8 << "\n";
        }
    }
}

/*
 * 8 の倍数であることが必要
 * 8 でわる
 * 11 以下は無理
 * というか大きかったら ok な気がする
 * それ以外は全探索するとか
 * 馬鹿でかの時に、どうするか
 * とりあえず貪欲に割り当てる
 * すると 1111 だらけになる
 * 1111 = 999 + 99 + 13
 * そういう感じに割り当てていけばいい
 *
 */