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;
set<ll> s;
int main(){
    ll K,cnt=0,xi=0,x;
    scanf("%lld",&K);
    for(int i=0;i<=14;++i){
        for(int j=0;j<i-(i>=11)+(i<1);++j){
            for(int k=0;k<=9;++k){
                x=xi+1ll*j*(ll)pow(10,i+1)+1ll*k*(ll)pow(10,i);
                if(x==0||s.count(x)) continue;
                ++cnt;
                s.insert(x);
                printf("%lld\n",x);
                if(cnt==K){
                    return 0;
                }
            }
        }
        xi=xi*10+9;
    }
    return 0;
}