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;
typedef long long ll;
typedef vector<ll> vl;
vl v;
ll nx(ll n) {
	if(n < 9) return n+1;
	n++;
	ll sm = 0;
	ll va = n;
	while(va) {
		sm += va%10;
		va /= 10;
	}
	ll ct = 0;
	while(sm < n+1) {
		ct++;
		sm += 9-(n%10);
		n /= 10;
	}
	for(int i=0;i<ct;i++) {
		n = n*10+9;
	}
	return n;
}
int main() {
	ll k;
	scanf("%lld",&k);
	ll ac = 1;
	for(int i=0;i<k;i++) {
		printf("%lld\n",ac);
		ac = nx(ac);
	}
}