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 Go (1.6) (judge verdict: Wrong Answer)

package main

import "fmt"

func pow(n,m int) int{
	if m == 0 {
		return 1
	} else {
		return n * pow(n,m-1)
	}
}

func calc(k int) int{
	a := k / 9
	b := k % 9
	ans := 0
	for i:=0; i<a; i++{
		ans = ans + 9 * pow(10,i)
	}
	ans = ans + b * pow(10,a)
	return ans
}

func main(){
	var k int
	fmt.Scanf("%d", &k)
	for i:=1; i<=k; i++{
		fmt.Println(calc(i))
	}
}