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 <bits/stdc++.h>
#include <string>
#include <iostream>
using namespace std;
int main(){
    int K,kaisuu, sunuke=9;
    cin >>K;
    if(K < 10){
        for(int i = 1;i<=K;++i){
            cout<<i<<endl;
        }
    }
    if(K > 9){
        for(int i = 1;i<=9;++i){
            cout<<i<<endl;
        }
        kaisuu = K - 9;
        for(int i = 1;i<=kaisuu;++i){
            sunuke = 9 + 10*i;
            cout<<sunuke<<endl;
        }
    }
}