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>


using namespace std;

#define pb push_back
const int maxi=1e6;
int a[maxi];
string s;
int n;
vector<long long> v;
int k;

int dig(long long m)
{
    int ans=0;

    while(m)
    {
        ans+=m%10;
        m/=10;
    }

    return ans;
}
int main()
{
     cin>>k;


    for (int i=1;i<=9;i++)
        v.pb(i);

    for (int i=1;i<=16;i++)
    {
        long long num=0;
        for (int j=1;j<=9;j++)
            {
                num=j;
                for (int l=1;l<=i;l++)
                    num=num*10+9;
                    v.pb(num);
            }
    }

    for (long long  i:v){
        printf("%lld\n",i);
        k--;
        if (!k) break;
    }

     return 0;
}