ayit第十二周周赛b题

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 11 to 99 (inclusive) are round.

For example, the following numbers are round: 40004000, 11, 99, 800800, 9090. The following numbers are not round: 110110, 707707, 222222, 10011001.

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

Input

The first line contains an integer tt (1≤t≤1041≤t≤104) — the number of test cases in the input. Then tt test cases follow.

Each test case is a line containing an integer nn (1≤n≤1041≤n≤104).

Output

Print tt answers to the test cases. Each answer must begin with an integer kk — the minimum number of summands. Next, kk terms must follow, each of which is a round number, and their sum is nn. 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 

#include<stdio.h>
#include<string.h>
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int k=0,i,s=1,a,a1[1000];
        scanf("%d",&a);
        while(a)
        {
            if(a%10)
            {
                 a1[k++]=a%10*s;
            }
            s=s*10;
            a=a/10;
        }
        printf("%d\n",k);
        for(i=0;i<k;i++)
        {
            if(i==0)
                printf("%d",a1[i]);
            else
                printf(" %d",a1[i]);
        }
        printf("\n");
    }
    return 0;
}

 

思路  先计算出输入数字不为0的位数 再依次输出以该数字开头的整数