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;
typedef pair<ll,ll> P;
const ll mod=1e9+7;
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define f first
#define s second

ll K;
ll digit(ll x){
  ll ret=0;
  while(x/10){
    ret+=(x%10);
    x/=10;
  }
  ret+=(x%10);
  return ret;
}

int main(){

cin.tie(0);
ios::sync_with_stdio(false);

cin>>K;

ll p=1;
ll n=1;
ll k=0;
while(1){
	if((n+p)*digit(n)>=n*digit(n+p)){
		cout<<n<<endl; 
		k++;
		n+=p;
		if(k==K) break;
	}else{
		n-=p;
		p*=10;
		n+=p;
	}
}


}
	
