As we all know, Rikka is not good at math. Yuta, her boyfriend, is worried about it. Therefore, he sets an interesting math problem For Rikka to practice.
Given a non-negative integer x, Rikka is required to find three non-negative integers a,b,c that satisfy the following three conditions:
represents the decimal string representation of integer d. For example, "0", "103".
String is a subsequence of string if and only if there exists an index sequence satisfying .
To avoid the case of no solution, Yuta assumes there is a special choice "-" for c where is equal to the empty string. Under this assumption, a=0, b=9, c=- becomes a valid solution of x=9.
Finding a valid solution is an easy task even for Rikka. Therefore, Rikka wants to increase the difficulty: Rikka wants you to find a valid solution (a,b,c) so that the length of is as large as possible.

The first line contains a single integer , representing the number of test cases.
For each test case, the first line contains a single integer .
The input guarantees that .

For each test case, output three lines, each with a single integer, representing a,b,c respectively.
If there are multiple optimal solutions, you need only to output any of them.

3
2290283839620
1
9999999

1145141919810
1145141919810
1145141919810
0
1
-
4545454
5454545
454545