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;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define repr(i,n) for(int i=(n)-1;0<=i;--i)
#define each(e,v) for(auto&& e:(v))
#define all(v) begin(v),end(v)
#define dump(x) cerr<<#x<<": "<<(x)<<endl
#define INF 100000000

long long int sum(long long int input){
    long long int k = 0;
    while(input > 0) {
        k += input % 10;
        input /= 10;
    }
    return k;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    long long int N;
    cin >> N;

    long long int temp = 1, temp2 = 1;

    cout << temp << endl;
    for(int i = 0; i < N - 1; i++) {
        if(sum(temp + temp2) * (temp + temp2 * 10) < sum(temp + temp2 * 10) * (temp + temp2)) temp2 *= 10;
        temp += temp2;
        cout << temp << endl;
    }
}
