/**
	author:  shobonvip
	created: 2025.08.22 22:14:13
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

vector<vector<ll>> precal(10000,vector<ll>(4,-1));

void solve(){
	ll n; cin >> n;
	if(n%8!=0){
		cout<<-1<<'\n';
		return;
	}
	n/=8;
	vector<ll> f(4);
	if(n>=10000){
		ll tar=n/1234;
		f[0]+=tar;
		f[1]+=tar;
		f[2]+=tar;
		f[3]+=tar;
		n%=1234;
		for(auto[x,y]:{
			pair(3,1111),
			pair(2,111),
			pair(1,11),
			pair(0,1)
		}){
			tar=n/y;
			f[x]+=tar;
			n-=tar*y;
		}
		cout<<f[0]<<' '<<f[1]<<' '<<f[2]<<' '<<f[3]<<'\n';
		return;
	}else{
		if(precal[n][0]==-1){cout<<-1<<'\n';return;}
		f[0]=precal[n][0];
		f[1]=precal[n][1];
		f[2]=precal[n][2];
		f[3]=precal[n][3];
		cout<<f[0]<<' '<<f[1]<<' '<<f[2]<<' '<<f[3]<<'\n';
		return;
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	rep(i,0,10000+1){
		rep(j,0,909+1){
			if(i+11*j>=10000)break;
			rep(k,0,90+1){
				if(i+11*j+111*k>=10000)break;
				rep(l,0,9+1){
					if(i+11*j+111*k+1111*l>=10000)break;
					int s=i+j+k+l;
					if(i*2>=s||j*2>=s||k*2>=s||l*2>=s){
						continue;
					}
					if(precal[i+11*j+111*k+1111*l][0]==-1){
						precal[i+11*j+111*k+1111*l][0]=i;
						precal[i+11*j+111*k+1111*l][1]=j;
						precal[i+11*j+111*k+1111*l][2]=k;
						precal[i+11*j+111*k+1111*l][3]=l;
					}
				}
			}
		}
	}
	
	int t;cin >> t;
	while(t--)solve();
}