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:
from fractions import Fraction
import bisect
import os
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq as hq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from collections import deque
import threading
from itertools import combinations
from io import BytesIO, IOBase
from itertools import accumulate


# sys.setrecursionlimit(200000)
# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline


def input():
    return sys.stdin.readline().strip()


def iinput():
    return int(input())


def tinput():
    return input().split()


def rinput():
    return map(int, tinput())


def rlinput():
    return list(rinput())


# mod = int(1e9)+7


def factors(n):
    return set(reduce(list.__add__,
                      ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))


# ----------------------------------------------------
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
for _ in range(iinput()):
    # n = iinput()
    # a = rlinput()
    # pref = list(accumulate(a))
    # pref.insert(0,0)
    # ans = 0
    # d = defaultdict(int)
    # for i in a:
    #     d[i] += 1
    # print(pref)
    # for i in range(1,n):
    #     for j in range(i+1, n+1):
    #         val = pref[j]-pref[i-1]
    #         if val in d and d[val]>0:
    #             print(val,'skd;')
    #             ans += 1
    #             d[val] -= 1
    # print(ans)
    # a, b, c = rinput()
    # if a==0:a-=1
    # if c==0:c-=1
    # a,c=c,a
    # ans = '1'*(a+1)+'0'*(c+1)
    # if a==-1 and c==-1:
    #     ans+='10'*math.ceil(b/2.0)
    #     if b%2==0 and b!=0:
    #         ans+='1'
    #     # print('hello')
    # elif a==-1:
    #     if b%2==0:
    #         ans+='10'*(b//2)
    #     else:
    #         ans+='10'*(b//2)+'1'
    # elif c==-1:
    #     if b%2:
    #         ans+='01'*(b//2)
    #     else:
    #         ans+='01'*(b//2)+'0'if b!=0 else ''
    # else:
    #     b-=1
    #     if b%2==0:
    #         ans+='10'*(b//2)
    #     else:
    #         ans+='10'*(b//2)+'1' if b>0 else ''
    # print(ans)
    n = str(iinput())
    ans = []
    temp = 0
    for i in range(len(n)-1, -1, -1):
        if n[i] == '0':
            temp += 1
            continue
        ans.append(n[i]+'0'*temp)
        temp += 1
    print(len(ans))
    print(*ans)