#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000005
#define Inf64 1000000000000000001LL


int main(){
	vector<vector<int>> ansa(1500);
	rep(i,10000){
		rep(j,1000){
			if(i+j*11>=ansa.size())break;
			rep(k,100){
				if(i+j*11+k*111>=ansa.size())break;
				rep(l,10){
					if(i+j*11+k*111+l*1111>=ansa.size())break;
					int m = max({i,j,k,l});
					if(m*2 >= i+j+k+l)continue;
					ansa[i+j*11+k*111+l*1111]={i,j,k,l};
				}
			}
		}
	}
	int _t;
	cin>>_t;
	rep(_,_t){
		
		long long n;
		cin>>n;
		if(n%8!=0){
			cout<<-1<<endl;
			continue;
		}
		n /= 8;
		if(n >= 1500){
			vector<long long> ans(4);
			rep(i,3){
				ans[i] += n/123;
			}
			n %= 123;
			vector<long long> t = {1,11,111};
			for(int i=2;i>=0;i--){
				ans[i] += n / t[i];
				n %= t[i];
			}
			rep(i,4){
				if(i!=0)cout<<' ';
				cout<<ans[i];
			}
			cout<<endl;
		}
		else{
			if(ansa[n].size()==0)cout<<-1<<endl;
			else{
				rep(i,4){
					if(i!=0)cout<<' ';
					cout<<ansa[n][i];
				}
				cout<<endl;
			}
		}
	}
}