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

public class Main {
        public static void main(String[] args){
            Scanner sc = new Scanner(System.in);
            long K = sc.nextLong();
            Set<Long> sunekeSet = new LinkedHashSet<>();
            for (long m =1; m <=10e15; m*=10){
                boolean sunukeCheckFlag = true;
                for(int i = 1; sunukeCheckFlag; i++){
                    long x = i * m + m - 1;
                    long y = (i + 1) * m + m - 1;
                    if (x * Sn(y) <=  y * Sn(x)){
                        sunekeSet.add(x);
                        if (K == sunekeSet.size()){
                            sunekeSet.stream().forEach(System.out::println);
                            return ;
                        }
                    }else{
                        sunukeCheckFlag = false;

                    }
                }
            }
        }
        public static long Sn(long num){
            long Sn = 0;
            while (num != 0){
                Sn += num % 10;
                num /= 10;
            }
            return Sn;
        }
}
