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# (Mono 4.6.2.0) (judge verdict: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;

class Program
{
    static void Main()
    {
        var Ks = ReadLine();
        var K = long.Parse(Ks);
        var l= 9-int.Parse(Ks[Ks.Length-1]+"");
        var a = K+l;
        var min = (double)a/a.ToString().Sum(x=>long.Parse(x+""));
        
        var c =0;
        var i =1;
        while (c!=K)
        {
            
            if ((double)i/i.ToString().Sum(x=>long.Parse(x+""))<=min)
            {
                WriteLine(i);
                c++;
            }
            i++;
        }

    }
}