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 <iostream>
using namespace std;
typedef long long ll;
ll k, ans;
double sunu;

ll pow(ll x, ll y){
    if (y == 0) return 1;
    return x * pow(x, y - 1);
}

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

double f(ll x){
    return (double)x / sum(x);
}

void func(ll x, ll y, ll z){
    if (pow(10, y - 1) > x) return;
    double a = f(x);
    if (a < sunu) {
        sunu = a;
        ans = x;
    }
    if (z == 9) {
        func(x, y + 1, x / pow(10, y) % 10);
    } else {
        func(x + pow(10, y - 1), y, z + 1);
    }
    return;
}

void g(ll x, ll y) {
    if (y == k) return;
    sunu = f(x) + 1;
    func(x, 1, x % 10);
    cout << ans << endl;
    g(ans + 1, y + 1);
    return;
}

int main(void){
    // Your code here!
    cin >> k;
    g(1, 0);
}
