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 <stdio.h>
int sunuke(int n);

int main(){
    int n;
    scanf("%d",&n);
    int sunukeN=sunuke(n); // m/S(m)

    for(int i=1;i<n;i++){
        if(sunuke(i)<=sunukeN){
            printf("%d\n",i);
        }
    }
}
int sunuke(int n){
    int fn=n;
    int sn=0;
    while(n>0){
        sn+=n%10;
        n/=10;
    }
    return fn/sn;
}