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
import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);
        long K = in.nextLong();
        long toPrint = 0L;
        long dif = 1L;
        for(int i=1;i<=K;i++){
            toPrint += dif;
            if(helper(toPrint+dif)>helper(toPrint+2*dif)) dif *= 10L;
            System.out.println(toPrint);
        }

    }
    public static double helper(long n){
        double s = (double) n;
        double sum = 0.0;
        while(n!=0){
            sum += (double) n%10;
            n = n/10;
        }
        return s/sum;
    }
}