def le(c):
    n = int(c)
    if n >= 8:
        return str(8)
    if n >= 1:
        return str(1)
    return str(0)

def solve(n):
    if n == 0:
        return []
    sn = str(n)
    res = ""
    for i in range(len(sn)):
        res += le(sn[i])
    return [res] + solve(n - int(res))

T = int(input())
for _ in range(T):
    N = int(input())
    res = solve(81181819 - N)
    print(len(res))
    print(*res, sep="\n")