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;

using ll = long long;
int a[20];
ll pw[20];

ll get_sum(ll n){
	ll ret = 0;
	while(n){
		ret += n % 10;
		n /= 10;
	}
	return ret;
}

int main(){
//	freopen("res.txt", "w", stdout);
	pw[0] = 1;
	for(int i = 1; i < 20; i ++) pw[i] = pw[i - 1] * 10;
	int k;
	cin >> k;
	ll cur = 1;
	for(int i = 0; i < k; i ++){
		ll tmp = cur;
		for(int j = 0; j < 16; j ++){
			a[j] = tmp % 10;
			tmp /= 10;
		}
		for(int j = 0; j < 16; j ++){
			if(a[j] == 9) continue;
			if((long double)(cur) / get_sum(cur) < (long double)(cur + pw[j] * 9) / get_sum(cur + pw[j] * 9)){
				break;
			}
			else {
				cur += (9 - a[j]) * pw[j];
			}
		}
		cout << cur << '\n';
		cur ++;
	}
}