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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long k = Long.parseLong(sc.next());
		long b = 0;
		for (long i = 1; i <= k; i++) {
			long c = 0;
			if (i < 10)
				c = i;
			else {//if (i < 28){
				boolean e = false;
				for (int j = 0; j < String.valueOf(b).length(); j++) {
					if (b / (long)Math.pow(10, j) % 10 != 9) {
						c = b + (long)Math.pow(10, j);
						e = true;
						break;
					}
				}
				if (!e)
					c = b + (long)Math.pow(10,String.valueOf(b).length());
			}
			/*else {
				boolean e = false;
				for (int j = 0; j < String.valueOf(b).length(); j++) {
					if (b / (long)Math.pow(10, j) % 10 != 9) {
						c = b + (long)Math.pow(10, j);
						e = true;
						break;
					}
				}
				if (!e)
					c = b + (long)Math.pow(10,String.valueOf(b).length() - 1);
			}*/
			System.out.println(c);
			b = c;
		}
	}
}