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 r(i,n) for(int i=0;i<n;i++)
using namespace std;
signed main(){
  int n,c=1,k=0;
  cin>>n;
  while(c<n&&c<10)cout<<c<<endl,c++;
  int m=9,x=10;
  while(c<=n){
    m+=x;
    cout<<m<<endl;
    k=m+x;
    int y=0;
    while(k>0){
      y+=k%10;
      k/=10;
    }
    k=m+x*10;
    int b=0;
    while(k>0){
      b+=k%10;
      k/=10;
    }
    if((m+x*10)*y<=(m+x)*b) x*=10;
    c++;
  }
}