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<iostream>
#include<algorithm>
#include<vector>
#include<math.h>
typedef long long int ll;
using namespace std;

ll S(ll n){
	ll cnt=0;
	while(n>0){
		cnt+=n%10;
		n/=10;
	}
	return cnt;
}
int main(){
	ll k; cin >>k;
	ll cnt=0;
	ll digit=1;
	for(ll i=0;i<k;i++){
		cnt+=digit;
		cout << cnt << endl;
		if((double)cnt/S(cnt)<(double)(cnt+digit)/S(cnt+digit)&&(double)(cnt+digit)/S(cnt+digit)>(double)(cnt+digit*2)/S(cnt+digit*2)){
			digit*=10;
		}
	}
	return 0;
}
