#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;

#define REP(i, N) for(int (i)=0; (i)<(N); (i)++)
#define ll long long
#define mp make_pair
#define pb push_back

int main() {
	int N;
	scanf("%d", &N);
	REP(testc, N) {
		int K;
		scanf("%d", &K);
		vector<int> V;
		V.pb(K);
		while(V[V.size()-1] >= 3) {
			int x = V[V.size()-1];
			V[V.size()-1] = x%3;
			V.pb(x/3);
		}
		for(int i = V.size()-1; i >= 0; i--) {
			printf("%d", V[i]);
			if(i > 0) printf(" ");
		}
		printf("\n");
	}
	return 0;
}