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>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
const int MOD=1e9+7;


int main() {
    int k;
    cin >> k;
    ll ten_ele=1;
    ll n=1;
    ll cnt=0;
    while (cnt<k) {
        ll m=n;
        ll s=0;
        while (m>0) {
            s+=m%10;
            m/=10;
        }
        // cout << s << ' ' << n << endl;
        if (ten_ele*s<n) {
            n-=ten_ele;
            ten_ele*=10;
        }
        else {
            cout << n << endl;
            ++cnt;
        }
        n+=ten_ele;
    }
}