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;
#define ll long long 
int solve(long long x){
    int ans=0;
    while (x>0){
    	ans+=x%10;
    	x/=10;
    }
    return ans;
}
int main(){
    int k;
    cin>>k;
    ll n=0,m,y;
    int x;
    for(int i=0;i<k;i++){
        n++;
        m=n;
        for(int d=0;d<15;d++){
            if (pow(10, d)>n) break;
            x=(ll)(n/pow(10, d))%10;
            y=(ll)(n/pow(10, d))-x;
            for (int s=1;s<=10;s++){
                if (x>=s) continue;
                if (1.0f*((ll)((y+s)*pow(10,d))-1)/solve((ll)((y+s)*pow(10, d))-1)<1.0f*m/solve(m)){
                    m=(ll)((y+s)*pow(10,d))-1;
                }
            }
        }
        n=m;
        cout<<n<<'\n';
    }
}
