Problem:
Score : 500 points

Problem Statement

Let S(n) denote the sum of the digits in the decimal notation of n.
For example, S(123) = 1 + 2 + 3 = 6.

We will call an integer n a Snuke number when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds.

Given an integer K, list the K smallest Snuke numbers.

Constraints

1 \leq K

The K-th smallest Snuke number is not greater than 10^{15}.

Input

Input is given from Standard Input in the following format:

K

Output

Print K lines. The i-th line should contain the i-th smallest Snuke number.

Sample Input 1

10

Sample Output 1

1
2
3
4
5
6
7
8
9
19

Solution in Python (3.4.3) (judge verdict: Wrong Answer)

def Sunuke(n):
    x = n % 9
    y = (n-x)/9
    if n <= 27:
        ans = (10**y)*(x+1) - 1
    else:
        if x == 0:
            ans = 999 + 1000*(y-3)
        else:
            ans = 99 + 100*x + 1000*(y-2)
    return ans

K = int(input())
for i in range(K):
    print(int(Sunuke(i+1)))