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;
typedef long long ll;

ll ds(ll n){
    ll res=0;
    while(n){res+=n%10; n/=10;}
    return res;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll K; cin >> K;
    ll a=0,cnt=0,i=1,last=0;
    while(K){
        ll n=(ll)i*pow(10,cnt)+a;
        if (n<=last){++i; continue;}
        if (n<=(ll)pow(10,cnt)*ds(n)){
            cout << n << endl;
            ++i,--K,last=n;
        }
        else {++cnt,i=1; a*=10,a+=9;}
    }
}