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>

long long int s(long long int n){
  if(n==0)
    return 0;
  return n%10+s(n/10);
}

int main(){
  long long int k,ans,i;
  scanf("%lld",&k);
  /*for(i=47999999;i<100000000;i+=1000000)
    printf("%lld %f\n",i,(double)i/s(i));*/
  ans=1;
  for(i=0;i<k;i++){
    printf("%lld\n",ans);
    if(ans<9)
      ans++;
    else if(ans<99)
      ans+=10;
    else if(ans<1999)
      ans+=100;
    else if(ans<29999)
      ans+=1000;
    else if(ans<399999)
      ans+=10000;
    else if(ans<4999999)
      ans+=100000;
    else if(ans<59999999)
      ans+=1000000;
    else if(ans<699999999)
      ans+=10000000;
    else if(ans<7999999999)
      ans+=100000000;
    else if(ans<89999999999)
      ans+=1000000000;
    else if(ans<999999999999)
      ans+=10000000000;
  }
}