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 {
	
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();

		long sunukeNum = 1;

		for(int i=0;i<n;i++){
			
			String sunukeString = "" + sunukeNum;
			double min = Double.MAX_VALUE;
			long sunukecand = 0;

			for(int j=0;j<sunukeString.length() + 1;j++){
				String nine = "";
				for(int k=0;k<j;k++){
					nine += "9";
				}

				String compose = sunukeString.substring(0,sunukeString.length() - j) + nine;
				double sunukecandidate = Long.parseLong(compose)*calc(Long.parseLong(compose));

				if(min > sunukecandidate){
					min = sunukecandidate;
					sunukecand = Long.parseLong(compose);
				}

			}

			System.out.println(sunukecand);
			sunukeNum = sunukecand + 1;

		}
	}
	public static double calc(long num){
		int gradesum = 0;
		while(num >= 1){
			gradesum += num%10;
			num = num/10;
		}
		return (double)1/gradesum;
	}
 
}