Sums of Digits
Vasya had a strictly increasing sequence of positive integers *a*1, ..., *a**n*. Vasya used it to build a new sequence *b*1, ..., *b**n*, where *b**i* is the sum of digits of *a**i*'s decimal representation. Then sequence *a**i* got lost and all that remained is sequence *b**i*.

Vasya wonders what the numbers *a**i* could be like. Of all the possible options he likes the one sequence with the minimum possible last number *a**n*. Help Vasya restore the initial sequence.

It is guaranteed that such a sequence always exists.
The first line contains a single integer number *n* (1<=≤<=*n*<=≤<=300).

Next *n* lines contain integer numbers *b*1, ..., *b**n*  — the required sums of digits. All *b**i* belong to the range 1<=≤<=*b**i*<=≤<=300.
Print *n* integer numbers, one per line — the correct option for numbers *a**i*, 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 *b**i*. 

If there are multiple sequences with least possible number *a**n*, print any of them. Print the numbers without leading zeroes.
none