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;
ll n;
double f(ll x){
	ll sum=0,xx=x;
	while(xx){
		sum+=xx%10;
		xx/=10;
	}
	return x*1.0/sum;
}
int main(){
	cin >> n;
	ll num=1;
	ll base=1;
	for(int i=1;i<=n;i++){
		cout << num << endl;
		double ii=f(num+base);
		double jj=f(num+base*10);
		if(ii>jj)
            base*=10;
		num+=base;
	}
	return 0;
}
