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)

k = int(input())

def snuke(num):
    s = 0
    for i in str(num):
        s += int(i)
    return num/s

def snuke_check(num):
    n = str(num)
    keta = len(n)    # numの桁数
    min_snuke = int(n[0] + '9'*(keta-1))
    if snuke(num) <= snuke(min_snuke):
        return True
    else:
        return False

count = 0
numbers = 1
while count < k:
    if snuke_check(numbers) is True:
        print(numbers)
        count += 1
    numbers += 1