/*
 Q. Digits
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Given a number N. Print the digits of that number from right to left separated by space.

Input
First line contains a number T (1 ≤ T ≤ 10) number of test cases.

Next T lines will contain a number N (0 ≤ N ≤ 109)

Output
For each test case print a single line contains the digits of the number separated by space.

Example
inputCopy
4
121
39
123456
1200
outputCopy
1 2 1
9 3
6 5 4 3 2 1
0 0 2 1
*/
//////////////////////////////////////////////////////////////////////////////////////////
//                                solution<1>
/////////////////////////////////////////////////////////////////////////////////////////
#include<iostream>
#include<string>
using namespace std;

int main()
{
	int t, n;
	cin >> t;
	for (int i = 0; i < t; i++)
	{
		cin >> n;
		string s = to_string(n);
		for (int j = s.length()-1; j >= 0; j--)
		{
			cout << s[j] << " ";
		}
		cout << "\n";
	}
	return 0;
}
//////////////////////////////////////////////////////////////////////////////////////////
//                                solution<2>
/////////////////////////////////////////////////////////////////////////////////////////
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
 
int main()
{
    int t;
    cin>>t;
    int digit;
    for(int i=0;i<t;i++)
    {
        cin>>digit;
        if(digit==0)
        {
            cout<<0<<endl;
        }else {
        while(digit!=0){
          cout<<digit%10<<" ";
          digit/=10;
        }
        cout<<endl;
    }
    }
    return 0;
}

int length = 1;
int x = 234567545;
while ( x /= 10 )
   length++;