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;
long long f(long long n)
{
    long long cnt =0;
    while(n){
        cnt+=(n%10);
        n/=10;
    }
    return cnt;
}
int main()
{
    long long n,k;
    cin>>k;
    long long s=1, d=1;
    for(int i=0; i<k; i++){
        cout<<s<<endl;
        while(1.0 *(s+d)/f(s+d)> 1.0 *(s+2*d)/f(s+2*d)){
            d*=10;
        }
        s+=d;
    }
}
