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

import java.util.Scanner;


public class Main {

	public static Scanner scanner = new Scanner(System.in);
	public static void main(String[] args) {
		int k = scanner.nextInt();
		printSnuke(k);
	}
	
	public static void printSnuke(int count) {
		int c = 0;
		for(int j=0;;j++) {
			for(int i=2; i <= 10; i++) {
				long snuke = (long)(Math.pow(10, j)) * i - 1;
				c++;
				if(c > count)
					return;
				System.out.println(snuke);
			}
		}
	}

}