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
#include<iostream>
using namespace std;
long long n,num=1,summand=1;
double S(long long x){
	long long sum=0,div=x;
	while(div){
		sum+=div%10;
		div=div/10;
	}
//	cout << (double)(x) << ' ' << (double)(sum) << ' ' << (double)(x)/(double)(sum) << endl;
	return (double)(x)/(double)(sum);
}
int main(){
	cin >> n;
	for(int i=1;i<=n;i++){
		cout << num << endl;
		double ii=S(num+summand),jj=S(num+summand*10);
		if(ii>jj) summand*=10;
		num+=summand;
	}
	return 0;
}