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<stdio.h>
double cal(long long x)
{
    long long sum=0,temp=x;
    while(x)
	{
        sum+=x%10;
        x/=10;
    }
    return (double)temp/sum;
}
int main()
{
	long long num=0,bot=1,temp1,temp2;
    int k;
    scanf("%d",&k);
    while(1)
	{
        while(1)
		{
			temp1=num+bot;
			temp2=num+bot*10;
			if(cal(temp1)<=cal(temp2))break;
            else bot=temp2-num;
        }
        num+=bot;
        printf("%lld\n",num);
        k--;
        if(!k)break;
    }
}