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 rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;


long double calc_s(ll m){
	long double ans(0);
	while(m >= 1){
		ans += m%10;
		m /= 10;
	}
	return ans;
}

int main(){
	ll k;
	cin >> k;
	ll ans(1), d(1);
	rep(i,k){
		cout << ans << endl;
		while ((ans + d - 1) / calc_s(ans + d) >= d) {
			d *= 10;
		}
		ans += d;
	}
	return 0;
}