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


public class Main {
    public static void main(String[] args) throws Exception {
        // Your code here!
        Scanner scanner=new Scanner(System.in);
        int K=scanner.nextInt();
        int keta=0;
        int kazu=1;
        for(int i=0;i<K;i++){
            if(kazu==10){
                kazu=1;
                keta++;
            }
            System.out.println((int)Math.pow(10,keta)*(kazu+1)-1);
            kazu++;
        }
    }
    public static long func(long x){
        if(x/10==0){
            return x%10;
        }
        return x%10+func(x/10);
    }
    
}