RUN Number

A positive integer $x$ is called a RUN number if all of its digits are the same digit. For example, $4$, $111$, and $888\,888$ are RUN numbers, but $27$, $334$, and $100\,000$ are not.

Given an $N$-digit number $K$, express $K$ as a sum of at most $(N+1)$ RUN numbers. It can be proven that this is always possible.

The first line contains the number of test cases $T$.

Each test case consists of one line with two integers $N$ and $K$, separated by a space.

For each test case, print the following.

• On the first line, print the number $M$ of RUN numbers whose sum is $K$ ($1\le M\le N+1$).
• On the second line, print the $M$ RUN numbers separated by spaces. If multiple answers exist, print any of them.

• $1\le T\le 100$
• $1\le N\le 17$
• $10^{N-1}\le K<10^N$. That is, $K$ is an $N$-digit number.