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>
using namespace std;
#define int long long
int get(int n) 
 { 
     int res = 0;
    while(n){
        res+= n%10;
        n/= 10; 
        
    }
  return res;
 } 
int32_t main() {
	int k;
	cin>>k;
    int a=1,p=1;
    for(int i=0;i<k;i++){
      cout<<a<<"\n";
      int n=a+p;
      int m=a+p*10;
      if(n*get(m)<=m*get(n)) a=n; 
      else 
       {  a=m; 
          p*=10;
           
       }
   }
}
