Vasya had a
strictly increasing sequence of positive integers
a1, ...,
an. Vasya used it to build a new sequence
b1, ...,
bn, where
bi is the sum of digits of
ai's decimal representation. Then sequence
ai got lost and all that remained is sequence
bi.
Vasya wonders what the numbers
ai could be like. Of all the possible options he likes the one sequence with the minimum possible last number
an. Help Vasya restore the initial sequence.
It is guaranteed that such a sequence always exists.
瓦夏有一个严格递增的正整数序列a1, ..., an.瓦夏用它来构建一个新序列b1, ...,bn其中bi是ai的位数之和的十进制表示形式。然后序列ai丢失了，剩下的就是序列bi.
瓦夏想知道这些数字ai是什么样子的。在所有可能的选项中，他喜欢最后一个数字最少的一个序列一个an.帮助瓦夏恢复初始序列。
可以保证这样的序列始终存在。
Output
Print
n integer numbers, one per line− the correct option for numbers
ai, in order of following in sequence. The sequence should be strictly increasing. The sum of digits of the
i-th number should be equal to
bi.
If there are multiple sequences with least possible number
an, print any of them. Print the numbers without leading zeroes.