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;
class Program{
	static void Main(){
		long s=long.Parse(Console.ReadLine());

		long i=1,t=1,e=1,z=0;
		double d=2;
		while(z<s){ 
			if(i/t==99){t*=10;}

			string st=i.ToString();
			int a=0;
			for(var j=0;j<st.Length;j=(j+1)|0){a+=int.Parse(st[j].ToString());}

			if(d<=1.0*i/a){Console.WriteLine("{0}",e);z++;}
			d=1.0*i/a;
			e=i;
			
			i+=t;
		}
	}
}