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.ArrayList;
import java.util.Collections;
import java.util.Scanner;

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

        ArrayList<Integer> l = new ArrayList<>();
        int k = sc.nextInt();

        int m = 1;
        while(l.size() < k){
            int n = m;
            do{
                n--;
                if(n == 0){
                    break;
                }

            }while (! (getNwaruSnNum(n) <= getNwaruSnNum(m)) );
            if(!l.contains(n) && n != 0){
                l.add(n);
            }
            m++;
        }
        Collections.sort(l);
        for (Integer aL : l) {
            System.out.println(aL);
        }

    }

    static double getNwaruSnNum(int n){
        int a = n;
        int sn = 0;
        do{
            sn += a % 10;
            a /= 10;
        }while(a > 0);

        return (double) n / (double) sn;
    }
}