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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main(void){
	long long k;
	long long count=0;
	scanf("%lld", &k);
	if(k<=9){
		for(int i=1; i<=k; i++){
			printf("%d\n", i);
		}
		return 0;
	}
	for(int i=1; i<=9; i++){
		printf("%d\n", i);
		count++;
	}
	long long i=19;
	long long  j=0,sum;
	while(count < k){
		j=i;
		sum = 0;
		while(j > 0){
			sum += j%10;
			j /= 10;
		}
		if(sum % 10 ==0){
			printf("%lld\n",i);
			count++;
		}	
		i++;
	}
	return 0;
}