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){
	
	int a,i,n=1;
	scanf("%d",&a);
	for(i=0;i<a;i++){
		printf("%d\n",n);
		n++;
		if(n%10==0)n=n+9;
		if(n%100==0)n=n+90;
		if(n%1000==0)n=n+900;
		if(n%10000==0)n=n+9000;
		if(n%100000==0)n=n+90000;
		if(n%1000000==0)n=n+900000;
		if(n%10000000==0)n=n+9000000;
		if(n%100000000==0)n=n+90000000;
		if(n%1000000000==0)n=n+900000000;
		if(n%10000000000==0)n=n+9000000000;
		if(n%100000000000==0)n=n+90000000000;
		if(n%1000000000000==0)n=n+900000000000;
		if(n%10000000000000==0)n=n+9000000000000;
		if(n%100000000000000==0)n=n+90000000000000;
		if(n%1000000000000000==0)n=n+900000000000000;
	}
	return 0;
}