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: Wrong Answer)

using System;
using System.Text;
using System.Collections.Generic;
using System.Linq;
//using System.Numerics;
class Program
{    
    public void Slove()
    {
        long k = long.Parse(Console.ReadLine());
            StringBuilder sb = new StringBuilder();
        while(k > 0)
        {
            foreach(int i in Enumerable.Range(1, 9))
            {
                Console.WriteLine(i.ToString() + sb);
                k--;
                if(k == 0)
                    break;
            }
            sb.Append("9");
        }
    }
    
    static void Main(string[] args)
    {
        new Program().Slove();
    }
}