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.*;

public class Main {

    static long s(long k) {
        char[] kk = String.valueOf(k).toCharArray();
        long ret = 0;
        for (int i = 0; i < kk.length; i++) {
            ret += kk[i] - '0';
        }
        return ret;
    }

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int k = sc.nextInt();
        ArrayList<Long> l = new ArrayList<>();
        for (int i = 1; i < 10; i++)
            l.add((long) i);
        long add = 1;
        int num = 0;
        while (true) {

            for (int i = 0; i < 1001; i++) {
                long ttk = add * i - 1;
                if (ttk < 1)
                    continue;
                l.add(ttk);
            }
            Collections.sort(l);
            for (int i = 0; i < l.size(); i++) {
                for (int j = i + 1; j < l.size(); j++) {
                    if (l.get(i).longValue() == l.get(j).longValue()) {
                        l.remove(j);
                        j--;
                        continue;
                    }
                }
            }

            IN: for (int i = 0; i < l.size(); i++) {
                double hoge = (double) l.get(i) / s(l.get(i));
                for (int j = i + 1; j < l.size(); j++) {
                    double kkk = (double) l.get(j) / s(l.get(j));
                    if (kkk < hoge) {
                        l.remove(i);
                        i--;
                        continue IN;
                    }
                }
            }

            if (num == 2)
                break;
            if (l.size() >= k) {
                num++;
            }

            add *= 10L;

        }

        for (int i = 0; i < k; i++) {
            System.out.println(l.get(i));
        }

    }

}
