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.*;


public class Main {
    public static void main(String[] args) {
        // 自分の得意な言語で
        // Let's チャレンジ！！
        String s[]={"1","2","3","4","5","6","7","8","9"};
        String l="";
        Scanner sc = new Scanner(System.in);
        String line = sc.nextLine();
        int k=Integer.parseInt(line);
        int a=10;
        for(int i=0;i<k;i++){
            if(i==27||i==18||i==9||i==56){
                l+="9";
            }
            if(i<36){
                System.out.println(s[i%9]+l);
            }
            else if(i<56){
                System.out.println(i+1+":"+a+l);
                a++;
            }
            else {
                System.out.println(s[i%9]+l);
            }
            
        }
    }
}