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 <stdio.h>
#include <string.h>
using namespace std;
int a[100001];
double s(long long n){
 long long i=n,j=0;
 while(i){
 	j+=i%10;
 	i/=10;
 }
 return (double)(n)/(double)j;
}
int main(){
	long long i=1,j=1,l,m,n;
	int k;
	scanf("%d",&k);
	while(k--){
	printf("%lld\n",i);
	while(s(i+j)>s(i+2*j))j*=10;
	i+=j;
	}
		
		

	return 0;
}