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 <bits/stdc++.h>

using namespace std;
#define BUF (1000)
#define ll long long 


ll n;
float snk(ll a){
	ll tmp=0;
	ll a_ = a;
	for(ll i=1;i<16;i++){
		tmp+=a_%10;
		a_/=10;
	}
	return (float)a/tmp;
}

int main(void){
	cin >> n;

	ll i=1;
	while(n){
		ll b = 10;
		float ans = snk(i);
		ll tmp=i;
		for(ll k=1;k<16;k++){
			if(ans>snk(i/b*b+b-1)){
				tmp = i/b*b+b-1;
				ans = snk(i/b*b+b-1);
			}
			b*=10;
		}
		cout << tmp << "\n";
		i=tmp+1;
		n--;
	}


	return 0;
}


