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.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;

public class Main {
    static int[][] map;
    static boolean[][] visited;
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
        long k = Long.parseLong(br.readLine());
        ArrayList<Long> ans = new ArrayList<Long>();
        for (int i = 0; i <= 15; i++) {
            for (int j = 1; j <= 9; j++) {
                String repeat = new String(new char[i]).replace("\0", String.valueOf(9));
                String snuke = j + repeat;
                ans.add(Long.parseLong(snuke));
            }
        }
        
        for (int i = 0; i < k; i++) {
            System.out.println(ans.get(i));
        }
        
    }
    /*
    public static void isSnuke(long l) {
        
    }
    
    public static long get_digit_sum(long l) {
        int digit_sum = 0;
        long temp = l;
        while (true) {
            digit_sum += temp % 10;
            temp /= 10;
            if (temp == 0) break;
        }
        return digit_sum;
    }*/
}