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;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;

#define mk make_pair
#define pb push_back
#define sc(t) scanf("%d",&t)
#define sc3(t,u,v) scanf("%d %d %d",&t,&u,&v)
#define sc2(t,u) scanf("%d %d",&t,&u)
#define scL(t) scanf("%lld",&t)
#define scL3(t,u,v) scanf("%lld %lld %lld",&t,&u,&v)
#define scL2(t,u) scanf("%lld %lld",&t,&u)
#define mem(a,i) memset(a,i,sizeof a)
#define pcase(x,y) printf("Case %d: %d\n",x,y)
#define pcase2(x) printf("Case #%d:\n",x)
#define inf 1e18
#define sett(n) (mark[n>>5] |= (1<<(n&31)))
#define check(n) (mark[n>>5]&(1<<(n&31)))
#define endd printf("\n")

int main()
{
    ll n,t=1,s=19;
    scL(n);
    for(int i=1;i<=n;i++){
        if(i<10){
            cout << t << endl;
            t++;
        }
        else{
            cout << s << endl;
            s+=10;
        }
    }
    return 0;
}