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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;

public final class Main {

    public static void main(String[] args) {
        final Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        final long n = Long.parseLong(in.nextLine());
        long k = 0, kk = 1;
        for (int i = 0; i < n; i++) {
            if ((k / kk) % 10 == 9 && f(k + kk) > f(k + 10 * kk)) { 
                kk *= 10;
            }
            k += kk;
            System.out.println(k);
        }
    }

    private static double f(long num) {
        long copy = num;
        long sum = 0;
        while (copy > 0) {
            sum += copy % 10;
            copy /= 10;
        }
        return (double) num / sum;
    }
}
