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 int k,i,j,keta,num[1000];
  scanf("%ld",&k);
  for(i=1;i<=10;i++){
    num[i] = i;
  }
  for(i=11;i<1000;i++){
    num[i] = pow(10,(i/10))*(i%10+1)-1;
  }
  for(i=1;i<=k;i++){
    printf("%ld\n",num[i+((i+i/10)/10)]);
  }
  return 0;
}*/
#include<stdio.h>
#include<math.h>
int main()
{
  float i,j,k,ans,count;
  scanf("%f",&k);
  i = 0;
  count = 0;
  while(count<k){
    for(j=1;j<10;j++){
      ans = j*pow(10,i);
      if(ans>=10){
        ans += pow(10,i)-1;
      }
      printf("%lld\n",(long long int)ans);
      count++;
      if(count==k)break;
    }
    i++;
  }
  return 0;
}