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 PYTHON3):

Solution:

'''test=int(input())
for i in range(test):
    a,b,c,d=[int(i) for i in input().split(" ")]
    x,y,x1,y1,x2,y2=[int(i) for i in input().split(" ")]
    ans1=0
    ans2=0
    if abs(x-x1)>=a and abs(x2-x)>=b:
        ans1=1
    elif abs(x-x1)>=a:
        if abs(x2-(x-a))>=b:
            ans1=1
    elif abs(x2-x)>=b:
        if abs(x+b-x1)>=a:
            ans1=1
    if abs(y-y1)>=c and abs(y2-y)>=d:
        ans2=1
    elif abs(y-y1)>=c:
        if abs(y2-(y-c))>=d:
            ans2=1
    elif abs(y2-y)>=d:
        if abs(y+d-y1)>=c:
            ans2=1
    
    if ans1&ans2:
        print("YES")
    else:
        print("NO")'''

'''b=int(input())
s1=[int(i) for i in input().split(' ')]
g=int(input())
s2=[int(i) for i in input().split(" ")]
s1.sort()
s2.sort()
ans=0
for i in range(b):
    for j in range(g):
        if abs(s1[i]-s2[j])<=1:
            s2[j]=1000
            ans+=1
            break
print(ans)
'''

#CF 639

'''test=int(input())
for i in range(test):
    n,m=[int(i) for i in input().split()]
    if n==1:
        print("YES")
    elif '''


'''test=int(input())
def value(t):
    return (t*(3*t+1))/2
def f(x):
    if x<2:
        return 0
    elif x==2:
        return 1
    else:
        h=1
        k=2
        
        while k<=x:
            h+=1
            k=value(h)
        card_used=value(h-1) if k!=x else k
        return 1+f(x-card_used)

for i in range(test):
    n=int(input())
    
    ans=f(n)
    #print(value(4))
    print(ans)  
    '''

#CF  640 (DIV-4)

test=int(input())
for i in range(test):
    n=int(input())
    ans=[]
    c=0
    while n:
        k=10**(c)
        ans.append((n%10)*k)
        c+=1
        n=n//10
    tes=[i for i in ans if i]
    print(len(tes))
    for j in tes:
        print(j,end=" ")