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;
#define pb push_back
map<ll,ll>mp;
vector<ll>v;
int main(){
	mp[10ll] = 10ll;
	mp[100ll] = 100ll;
	mp[2000ll] = 1000ll;
	mp[30000ll] = 10000ll;
	mp[400000ll] = 100000ll;
	mp[5000000ll] = 1000000ll;
	mp[60000000ll] = 10000000ll;
	mp[700000000ll] = 100000000ll;
	mp[8000000000ll] = 1000000000ll;
	mp[90000000000ll] = 10000000000ll;
   mp[1000000000000ll] = 100000000000ll;
   mp[10000000000000ll] = 1000000000000ll;
   mp[110000000000000ll] = 10000000000000ll;
 //  mp[1000000000000000ll] = 100000000000000ll;
   ll x = 1;
	ll add = 1;
	while(x<=1e16){
		x+=add;
		v.pb(x-1);
		if(mp.count(x))add = mp[x];
	}
	int k; 
	cin>>k;
	for(int i=0;i<k;i++){
		cout<<v[i]<<endl;
	}
	return 0;
}
