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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long

LL n,x=1,base=1;  

inline double S(LL x)
{
	LL tmp=x,sum=0;
	while (tmp>0)
	{
		sum+=tmp%10;
		tmp/=10;
	}	
	return (double)x/double(sum);
} 

int main(){
	scanf("%lld",&n);
	for (LL i=1;i<=n;i++)
	{
		printf("%lld\n",x);
		double now,now_;
		now=S(x+base);
		now_=S(x+base*10);
		if (now_<now) base*=10;
		x+=base;
	}
	return 0;
}