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()
{
    unsigned long long int i,j=0,k,m=0,l=0;
    float ans1=0,ans2=0,rem1=0,rem2=0;
    scanf("%llu",&k);
    for(i=1;i<=1000000000000000;i++)
    {
        j=i;
        while(i!=0)
        {
            rem1= rem1+ (i%10);
            i= i/10;
        }
        i=j;
        m=i+1;
        while(m!=0)
        {
            rem2 = rem2 + (m%10);
            m=m/10;
        }
        i=j;
        ans1= i/rem1;
        ans2= (i+1)/rem2;
        if(l>=k)
        {
            break;
        }
        if(ans1<=ans2)
        {
            l++;
                        printf("%llu\n",j);

        }
        j=0;
        rem1=0;
        rem2=0;
        ans1=0;
        ans2=0;
    }
    return 0;
}