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 
# # # import numpy as np
# # # a = np.array([[1,2,3],[4,5,6]])
# # # print(a.ndim)
# # # f = open("hello.txt","w")
# # # f.write("Hello Darkness my old friend!")
# # # f.close()

# # # f = open("hello.txt","a")
# # # f.write("\nHello Darkness my old friend!")
# # # f.close()

# # # f = open("hello.txt","r")
# # # for x in f:
# # # 	print(x)

# # # import os
# # # os.remove("hello.txt")
# # # k = int(input())

# # # if not type(k) is int:
# # # 	raise TypeError("Integer daalna hai :|")
# # # else:
# # # 	print("Correct :)")

# # # try:
# # # 	k = int(input())
# # # except ValueError:
# # # 	raise TypeError("Integer Daalna")
# # # else:
# # # 	print("Correct")
# # x = "hello"

# # if not type(x) is int:
# #   raise TypeError("Only integers are allowed")
# # import math
# for _ in range(int(input())):
# 	n = int(input())
# 	k = n
# 	l =[]
# 	for i in range(math.floor(math.log(k, 10)+1)):
# 		r = n%10
# 		if(r!=0):
# 			l += [(r*pow(10,i))]
# 		n = n//10
# 	print(len(l))
# 	for x in l:
# 		print(x,end=" ")

# # def z(n,k):
# # 	if(k<n):
# # 		return(k)
# # 	else:
# # 		s = k//n
# # 		if((k + s)//n == s):
# # 			return(k + s)
# # 		else:
# # 			m = s*n
# # 			k = k - s*n + s
# # 			return(m + z(n,k))

# # for _ in range(int(input())):
# # 	n,k = map(int,input().split())
# # 	print(z(n,k))
for _ in range(int(input())):
	n = int(input())
	l = []
	for i in range(5):
		if(n%10 != 0):
			l += [n%10 * pow(10,i)]
		n = n//10
		if(n==0):
			break
	print(len(l))
	for x in l:
		print(x,end=" ")

# def z(n,k,x):
# 	if(k*x > n):
# 		print("NO")
# 		return
# 	else:
# 		l = []
# 		for _ in range(k-1):
# 			l+=[x]
# 		l+=[n - x*k + x]
# 	print("YES")
# 	for x in l:
# 		print(x,end=" ")
# 	return

# for _ in range(int(input())):
# 	n,k = map(int,input().split())
# 	if(k%2==0):
# 		if(n%2==0):
# 			z(n,k,1)
# 		else:
# 			print("NO")
# 	else:
# 		if(n%2==0):
# 			z(n,k,2)
# 		else:
# 			z(n,k,1)