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;
inline double f(long long m) {
    long long n = m;
    long long s = 0;
    while (n) {
        s += n%10;
        n /= 10;
    }
    return (double)m/s;
}
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int K;
    cin >> K;
    long long snuke = 0, addition = 1;
    while (K--) {
        snuke += addition;
        if (f(snuke+addition)>f(snuke+addition*2)) addition *= 10;
        printf("%lld\n", snuke);
    }
    return 0;
}