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;

int64_t nextSnuke(int64_t n) {
    if(n <= 9)
        return n;

    int64_t best_num = 0;
    int64_t best_denom = -1;
    
    vector<int> d;
    int64_t aux = n;

    while(aux > 0) {
        d.push_back(aux % 10);
        aux /= 10;
    }

    int sz = d.size();

    for(int i = 0; i < sz; ++i) {
        vector<int> t = d;
        for(int j = 0; j <= i; ++j)
            t[j] = 9;
        int64_t num = 0;
        int64_t denom = 0;

        for(int j = sz - 1; j >= 0; --j) {
            num = 10LL * num + t[j];
            denom += t[j];
        }
         
        if(best_denom == -1 or best_num * denom > num * best_denom) {
            best_denom = denom;
            best_num = num;
        }
    }
    
    return best_num;
}

int main() {
    int k; cin >> k;
    
    int64_t temp = 1;
    for(int i = 0; i < k; i += 1) {
        cout << temp << "\n";
        temp = nextSnuke(temp + 1);
    }
}