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
using namespace std;


int K;
vector<int> cand;
vector<int> ans;


int S(int x){
    int res = 0;
    while(x > 0){
        res += x%10;
        x /= 10;
    }
    return res;
}


double g(int x){
    return (double)x/S(x);
}


signed main(){
    cin >> K;

    int p10 = 1, n = 0;
    for(int i = 0;i <= 12;i++){
        for(int j = 1;j <= 999;j++) if(j*p10+n <= 1e15-1) cand.push_back(j*p10+n);
        n *= 10;
        n += 9;
        p10 *= 10;
    }

    sort(begin(cand), end(cand), greater<int>());
    cand.erase(unique(begin(cand), end(cand)), end(cand));

    ans.push_back(cand[0]);
    double m = g(cand[0]);
    for(int i = 1;i < cand.size();i++)
        if(g(cand[i]) <= m) m = g(cand[i]), ans.push_back(cand[i]);

    reverse(begin(ans), end(ans));

    for(int i = 0;i < K;i++) cout << ans[i] << endl;

    return 0;
}