Problem: A positive (strictly greater than zero) integer is called round if it is of the form d00...0. In other words, a positive integer is round if all its digits except the leftmost (most significant) are equal to zero. In particular, all numbers from 1 to 9 (inclusive) are round.

For example, the following numbers are round: 4000, 1, 9, 800, 90. The following numbers are not round: 110, 707, 222, 1001.

You are given a positive integer n (1 ≤ n ≤ 10^4). Represent the number n as a sum of round numbers using the minimum number of summands (addends). In other words, you need to represent the given number n as a sum of the least number of terms, each of which is a round number.

Input

The first line contains an integer t (1 ≤ t ≤ 10^4) — the number of test cases in the input. Then t test cases follow.

Each test case is a line containing an integer n (1 ≤ n ≤ 10^4).

Output

Print t answers to the test cases. Each answer must begin with an integer k — the minimum number of summands. Next, k terms must follow, each of which is a round number, and their sum is n. The terms can be printed in any order. If there are several answers, print any of them.

Example

Input


5
5009
7
9876
10000
10


Output


2
5000 9
1
7 
4
800 70 6 9000 
1
10000 
1
10 

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		problemB();
	}

	public static void problemA() throws NumberFormatException, IOException {
		BufferedReader entrada= new BufferedReader(new InputStreamReader(System.in));
		int t=Integer.parseInt(entrada.readLine());
		String temp[];
		for (int i = 0; i < t; i++) {
			temp=entrada.readLine().split(" ");
			BigInteger number1= new BigInteger(temp[0]);
			BigInteger number2= new BigInteger(temp[1]);
			System.out.println(number1.add(number2));
		}
	}
	
	public static void problemB() throws NumberFormatException, IOException {
		BufferedReader entrada= new BufferedReader(new InputStreamReader(System.in));
		int t=Integer.parseInt(entrada.readLine());
		int contador=0;
		String temp;
		String answer="";
		for (int i = 0; i < t; i++) {
			temp=entrada.readLine();
			if (Integer.parseInt(temp)<=10) {
				System.out.println(1);
				System.out.println(temp);
				continue;
			}
			for (int j = temp.length()-1 ; j >= 0; j--) {
				if(temp.charAt(j)!='0') {
					answer+=""+temp.charAt(j);
					for (int k = 0; k < contador; k++) {
						answer+="0";
					}
					answer+=" ";
				}
				contador++;
			}
			System.out.println(answer.split(" ").length);
			System.out.println(answer);
			contador=0;
			answer="";
			
		}
		
	}
	public static void problemE() throws NumberFormatException, IOException {
		BufferedReader entrada= new BufferedReader(new InputStreamReader(System.in));
		int numHex= Integer.parseInt(entrada.readLine(),16);
		String binary= Integer.toBinaryString(numHex);
		System.out.println(binary.charAt(binary.length()-1));
	}
	
	public static void problemD() throws IOException {
		BufferedReader entrada= new BufferedReader(new InputStreamReader(System.in));
		int t=Integer.parseInt(entrada.readLine());
		BigInteger number;
		for (int i = 0; i < t; i++) {
			number=new BigInteger(entrada.readLine());
			if (number.toString().equals("1")) {
				System.out.println(0);
				continue;
			}
			if (number.toString().equals("2")) {
				System.out.println(0);
				continue;
			}
			if (number.toString().equals("3")) {
				System.out.println(1);
				continue;
			}
			number=number.divide(new BigInteger("2"));
			if (number.mod(new BigInteger("2")).equals(new BigInteger("0")))number=number.add(new BigInteger("-1"));
			System.out.println(number);
		}
		
	}
}