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) {	
	Main main = new Main();
    	main.solveD();
    }
    
    private void solveA() {
	Scanner sc = new Scanner(System.in);
    	String s = sc.next();
	int ans = 0;

	for (int i=0;i < 4;i++){
	    if (s.charAt(i) == '+'){
		ans++;
	    }
	    else{
		ans--;
	    }
	}
    	System.out.println(ans);
    }

    private void solveB() {
	Scanner sc = new Scanner(System.in);
	int n = sc.nextInt();
	int m = n;
	int s = 0;

	while(n != 0){
	    s += n%10;
	    n /= 10;
	}

	if (m%s == 0){
	    System.out.println("Yes");
	}
	else{
	    System.out.println("No");
	}
    }
    private void solveC() {
	Scanner sc = new Scanner(System.in);
	int n = sc.nextInt();
	int k = sc.nextInt();
	int[] a = new int[n];
	
	for(int i=0; i < n; i++){
	    a[i] = sc.nextInt();
	}

	n--;
	k--;
	int cnt = 0;
	while(n>0){
	    n -=k;
	    cnt++;
	}

	System.out.println(cnt);
    }
    private void solveD() {
	Scanner sc = new Scanner(System.in);
	long k = sc.nextLong();
	long cnt = 1;
	
	for(long i=1; i <= k; i++){
	    System.out.println(cnt);
	    if (i<9){
		cnt++;
	    }
	    else{
		cnt += 10;
	    }
	}
    }
}