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<iostream>
#include<string>
#include<vector>
#include<map>
using namespace std;
#define ll long long
int main(){
  ll K;
  cin >> K;
  int a=1;
  int size=0;
  ll i,j;
  for(i=0;i<K-1;i++){
      cout << a;
      for(j=0;j<size;j++){
        cout << 9;
      }
      a++;
      if(a==10){
        size++;
        a=1;
      }
      if((size>=9)&&(a==1)){
        a++;
      }
      cout << "\n";
  }
  cout << a;
  for(j=0;j<size;j++){
    cout << 9;
  }
  return 0;
}