CF354E.Lucky Number Representation

We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he assumes it also is lucky! Lucky numbers are such non-negative integers whose decimal record only contains lucky digits. For example, numbers 0, 47, 7074 are lucky, but 1, 7377, 895,  -7 are not.

Vasya has t important positive integers he needs to remember. Vasya is quite superstitious and he wants to remember lucky numbers only, so he is asking you for each important number to represent it as a sum of exactly six lucky numbers (Vasya just can't remember more numbers). Then Vasya can just remember these six numbers and calculate the important number at any moment.

For each of t important integers represent it as the sum of six lucky numbers or state that this is impossible.

我们知道幸运数字是数字 4 和 7，但瓦夏（Vasya）还有另一个他钟爱的数字 0，他认为 0 也是幸运数字！幸运数是指其十进制表示中仅包含幸运数字的非负整数。例如，数字 $0$、$47$、$7074$ 是幸运数，但 $1$、$7377$、$895$、$-7$ 不是。

瓦夏有 $t$ 个需要牢记的重要正整数。瓦夏非常迷信，他只想记住幸运数，因此他请求你对每个重要数字，将其表示为恰好六个幸运数之和（因为瓦夏实在记不住超过六个数）。这样，瓦夏只需记住这六个数，便可在任意时刻计算出该重要数字。

对于每个 $t$ 个重要整数，请将其表示为六个幸运数之和；若不可能，则说明这一点。

The first line contains a single integer t (1 ≤ t ≤ 5000).

Next t lines contain a single positive integer n__i (1 ≤ n__i ≤ 1018) — the list of important numbers.

Please, do not use the %lld to read or write 64-bit integers С++. It is preferred to read the cin, cout streams or the %I64d specifier.

第一行包含一个整数 $t$（$1 \leq t \leq 5000$）。

接下来的 $t$ 行，每行包含一个正整数 $n_i$（$1 \leq n_i \leq 10^{18}$）——这些是重要的数字。

请注意，在 C++ 中不要使用 %lld 来读取或写入 64 位整数。推荐使用 cin / cout 流，或使用 %I64d 说明符。

Print t lines. The i-th line must contain the answer for the i-th important number: if the solution exists, the line must contain exactly six lucky numbers the sum of which equals n__i, if the solution doesn't exist the string must contain a single integer -1.

If there are multiple answers print any of them.

输出 t 行。第 i 行必须包含第 i 个重要数字的解：若解存在，则该行必须恰好包含六个幸运数字，其和等于 n__i；若解不存在，则该行必须仅包含一个整数 -1。

若存在多个解，输出任意一个即可。