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 
"""
this code is correct but syntax of output is different,because we are taking storing output in
two lists. So,unpacking is difficult.

outputlist = []
listk = []
roundlist = []
no = 0
for i in range(int(input())):
    num = input()
    k = len(num)- num.count("0") 
    listk.append(k)
    for j in range(len(num)):
        if num[j] == "0":
            continue
        else:
            roundlist.append(f'{num[j]}{"0"*(len(num)-j-1)}')
            if not listk == [] and j == 0:
                outputlist.append(listk)
    outputlist.append(roundlist)
    listk = []
    roundlist = []
print(*outputlist, sep="\n")"""
"""
now we are storing input and proceeding each input one by one.
so< there is no need to store output. we can directly print them.
"""
n = [input() for i in range(int(input()))]
outputlist = []
for j in range(len(n)):
    for l in range(len(n[j])):
        if n[j][l] == "0":
            continue
        else:
            outputlist.append(f'{n[j][l]}{"0"*(len(n[j])-l-1)}')
    print(len(n[j]) - n[j].count("0"))
    print(*outputlist)
    outputlist = []