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 LuaJIT (2.0.4) (judge verdict: Time Limit Exceeded)

function snuke(k)
  local snuke = 0
  local tmp = k
  while(0 < tmp) do
    local a = tmp % 10
    snuke = snuke + a
    tmp = (tmp - a) / 10
  end
  return k / snuke
end

k = io.read("*n")
dig = 0
cnt = 0
min = 1
while(cnt < k) do
  for i = 1, 9 do
    v = i
    for j = 1, dig do
      v = v * 10 + 9
    end
    snk = snuke(v)
    if(min <= snk) then
      cnt = cnt + 1
      min = snk
      print(v)
      if(cnt == k) then break end
    end
  end
  dig = dig + 1
end