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<stdlib.h>
#include<limits.h>
#include<math.h>
#include<string.h>

int main(void){
	int k;
	long long int i,f,count=0;
	double a[100000];

	
	scanf("%d",&k);
	for(f=1;1;f*=10){
		for(i=2;i<=10;i++){
			printf("%lld\n",i*f-1);
			count++;
			if(count>=k)return 0;
		}
	}
	
	return 0;
}