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

class Main
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);

        int K = sc.nextInt();

        if(K <= 8){
            for(int i = 1; i <= K; i++){
                System.out.println(i);
            }
        }
        else{
            int count = 8;

            for(int i = 1; i <= 8; i++){
                System.out.println(i);
            }


            int ll = 0;
                for(int j = 1; j < 15; j++){
                    for(int i = 1; i <= 9; i++){
                        System.out.println((long) (i * (long)Math.pow(10, j) - 1));
                        count++;
                        if(count == K){
                            ll = 1;
                            break;
                        }
                    }
                    if(ll == 1){
                        break;
                    }
                }
        }
    }
}