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: Runtime Error)

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long K = sc.nextLong();
        ArrayList<Long> ans = new ArrayList<Long>();
        for (int i=1;i<=9;i++) {
            ans.add((long)i);
        }

        for (int i=1;i<15;i++) {
            for (int j=1;j<=9;j++) {
                StringBuilder sb = new StringBuilder();
                sb.append(j);
                for (int k=0;k<i;k++) {
                    sb.append(9);
                }
                ans.add(Long.parseLong(sb.toString()));
            }
        }

        for (int i=0;i<K;i++) {
            System.out.println(ans.get(i));
        }
    }
}