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>
#define ll long long
#define pb push_back
#define f first
#define s second
using namespace std;
double delta(ll x){
	ll c = x, s = 0;
	while( c> 0){
	 	s += c%10; c/= 10;
	}
	return (double)1.0*x/s;
}
int main(){
	int ub = 100, cnt = 0;
	cin >> ub;
	ll a = 0, b=1;
	for(int i = 0; i< ub; i++){
		if((a/b)%10 == 9 && delta(a+b) > delta(a+10*b))b*=10;
		a += b;
		cout <<a  << endl;
  	}
	return 0;
}                  
