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 int long long
#define f(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int,int>
using namespace std;
double sum(int a){
	double b=a,c=0;
	while(a){
		c+=a%10;
		a/=10;
	}
	return b/c;
}
signed main(){
	int a,ans=0,an=0,x=1;
	cin>>a;
	while(a){
		if(sum(ans+x)<=sum(an+x*10)){
			ans+=x;
			cout<<ans<<endl;
			a--;
		}
		else x*=10;
		if(ans>=an+x*9) an=ans;
	}
	return 0;
}
