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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <math.h>

int main() {
  long long k;
  int count = 9;
  int flag = 0;
  scanf("%lld", &k);

  long long num[k];

  for(int i = 0; i < 9; i++){
    if(i >= k) break;
    num[i] = i+1;
  }

  int i = 1;

  while(1){
    if(flag == 1) break;
    for(int j = 1; j < 10; j++){
      if(count >= k){
        flag = 1;
        break;
      }
      num[count] = j*(long long)pow(10,i) + ((long long)pow(10, i) - 1);
      count++;
    }
    i++;
  }

  for(int i = 0; i < k; i++){
    printf("%lld\n", num[i]);
  }

  return 0;

}