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.Collections.Generic;
using System.Linq;
using System.Text;

class MainClass
{

    public static void Main()
    {
        var k = int.Parse(Console.ReadLine());
        var ls = CreateSnukeNum();
        var unti = ls.Take(k);
        foreach (var item in unti)
        {
            Console.WriteLine(item);
        }
        Console.ReadLine();
    }

    public static List<long> CreateSnukeNum()
    {
        var ls = new List<long>();
        for (int i = 1; i < 9; i++)
        {
            ls.Add(i);
        }
        for (int i = 1; i <= 15; i++)
        {
            var str = "";
            for (int j = 0; j < i; j++)
            {
                str += 9;
            }
            for (int j = 0; j < 10; j++)
            {
                // if (str != "")
                    ls.Add((long)Math.Pow(10, i) * j + long.Parse(str));
            }
        }
        return ls;
    }
    
}