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<iostream>
using namespace std;

long long dsum(long long n){
  long long res = 0;
	while(n > 0){
      res += n % 10;
      n /= 10;	
    }
  return res;
}


int main(){
  long long K;
  cin >> K;
  for (int i = 1; i < 10; i++){
    if (!K) return 0;
    cout << i << endl;
    K--;
  }
  long long tmp = 10;
  long long i = 19;
  while (i <= 1000000000000000L){
    if (!K) return 0;
    printf("%lld\n", i);
    K--;
    if ((double)(i+tmp)/(double)dsum(i+tmp) > tmp) tmp *= 10;
    i += tmp;
  }
}
