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.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        long k = sc.nextLong();
        for(long i = 1; i <= 8;i++){
            if(i > k){
                break;
            }
            System.out.println(i);
        }
        long cnt = 8;
        for(long i = 9; i <= Math.pow(10,15);i+=10){
            if(cnt >= k){
                break;
            }
            if(i*sum(i+1) <= (i+1)*sum(i)){
                cnt++;
                System.out.println(i);
            }
        }
    }
    public static long sum(long x){
        long ans = 0;
        while(x != 0){
            ans += x % 10;
            x /= 10;
        }
        return ans;
    }
}