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) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner input = new Scanner(System.in);
        long K = input.nextLong();

        long ans1 = 0;
        long ans2 = 0;
        int beki = 0;
        int cnt = 1;
        int zyousan = 1;

        for(int i = 1; i <= K; i++,cnt++){


        	if(cnt == 10){
        		ans2 = ans1;
        		beki += 1;
        		cnt = 1;
        		zyousan = pow(10, beki);
        	}

        	ans1 = cnt * zyousan;
        	ans1 += ans2;

        	System.out.println(ans1);
        }

	}

	public static int pow(int x, int y) {
	    return (new Double(Math.pow((double) x, (double) y))).intValue();
	  }

}