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;
typedef long long int ll;

double s(ll x) {
  ll xx = x, sum = 0;
  while (xx) {
    sum += xx % 10;
    xx /= 10;
  }
  return (double)x / sum;
}

int main() {
  int K;
  cin >> K;
  ll n = 1, m = 1;
  for (ll i = 1; i <= K; i++) {
    cout << n << endl;
    while (s(n + m) > s(n + m * 10)) m *= 10;
    n += m;
  }
}
