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

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
long long a[16];
long long k;
long long ans=0;
long long nt=0;
long long temp=0;
int main()
{
	a[0]=1;
	for(int i=1;i<=15;i++)
	{
		a[i]=a[i-1]*10;
	}
	scanf("%lld",&k);
	while(1)
	{
		for(int i=1;i<=9;i++)
		{
			temp+=a[nt];
			printf("%lld\n",temp);
			ans++;
			if(ans==k) break;
		}
		nt++;
		if(ans==k) break;
	}
}