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 d=1;

int S(long long x){
	if(!x) return 0;
	return x%10+S(x/10);
}

long long f(long long n){
	if(S(n+d*10)*(n+d) > (n+d*10)*S(n+d)) d*=10;
	return n+d;
}

int main(){
	int K;
	cin  >> K;
	int cur=1;
	long long n=1;
	for(int i=0;i<K;i++){
		if(i!=0) n=f(n);
		cout << n << endl;
	}
}
