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 <bits/stdc++.h>
using namespace std;

long sum_n(long n){
  long x = 0; long k = n; long sum = 0;
  while(k){
    x = k % 10;
    k = (k - x) / 10;
    sum += x;
  }
  return sum;
}

int main() {
  long K; cin >> K;
  long plusnum = 1; long ans = 0; long checkans = 0;
  for(long i = 0; i < K; i++){
    checkans = ans + plusnum;
    if (checkans > sum_n(checkans) * plusnum){
      plusnum *= 10;
        }
    ans += plusnum;
    cout << ans << endl;
  }
  return 0;
 
}