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.

Example

Input

10


Output

1
2
3
4
5
6
7
8
9
19
import java.util.Scanner;

public class Main {
	/*
	 * idea : 
	 * 	suppose output_m1 is a snukeNumber
	 *  first plus 1 and check whether 10^numberOfTrailNine()*S(output)≥output
	 *  if true then output
	 *  else plus 10^i and verify again until find next value;
	 */

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int K = sc.nextInt();
		int k=1;
		long output = 0;
		labelB:
		while(k<=K) {
			labelA:
			while(output < Math.pow(10, 15)){
				long temp = output;
				for(int i = 0; i < 15 ; i++) {
					temp += (long) Math.pow(10, i);
					if(Math.pow(10, countNineNumber(temp))*digitSum(temp) >= temp) {
						output = temp;
						System.out.println(output);
						k++;
						break labelA;
					}else {
						temp = output;
					}
				}
			}
			if(output > Math.pow(10, 15)) {
				break;
			}
		}

	}

	private static int countNineNumber(long n) {
		int count = 0;
		while(n!=0) {
			if(n%10==9) {
				count ++;
			}else {
				break;
			}
			n /= 10;
		}
		return count;
	}
	public static int digitSum(long n) {
		int sum = 0;
		while(n != 0) {
			sum += n%10;
			n /= 10;
		}
		return sum;
	}

}