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;
unsigned long long i,j,n,m,x,k,y,a,b;
int main()
{
    std::cin.sync_with_stdio(false);
    std::cin.tie(0);
    cin >> n;
    i=1;
    while (i<=n&&i<10)
    {
        cout << i << "\n";
        i++;
    }
    m=9;
    x=10;
    while (i<=n)
    {
        m+=x;
        cout << m << "\n";
        k=m+x;
        y=0;
        while (k>0)
        {
            y+=k%10;
            k/=10;
        }
        a=m+x*10;
        b=0;
        while (a>0)
        {
            b+=a%10;
            a/=10;
        }
        //cout << m+x*10 << " " << y << " " << m+x << " " << b << "\n";
        if ((m+x*10)*y<=(m+x)*b)
        {
            x*=10;
        }
        i++;
    }
    return 0;
}