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



Sample input:
10


Sample output:
1
2
3
4
5
6
7
8
9
19

Submission status: Runtime Error

Solution code:
from sys import stdin, stdout

ans = []
cur = 0

while not len(ans) or ans[-1] < 10 ** 15:
    for i in range(1, 10):
        ans.append(int(str(i) + cur * '9'))
        
    cur += 1

k = int(stdin.readline())
for i in range(k):
    stdout.write(str(ans[i]) + '\n')

Submission status: Runtime Error

Solution code:

import sys
#sys.stdin=open("data.txt")
input=sys.stdin.readline

nums=[]

num=0
pow10=1
for i in range(1000):
    num+=pow10
    if num>10**15: break
    if i%9==8: pow10*=10
    nums.append(num)

k=int(input())
for i in range(k):
    print(nums[i])