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
// review

#include <iostream>
#include <vector>

using namespace std;
typedef long long ll;
const ll INF = 1e15+10;

ll k;

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

double g(ll n) {
  return (double)n / f(n);
}

vector<ll> v;

void check(ll n) {
  double cur = g(n);
  while (!v.empty()) {
    ll prev = v[v.size() - 1];
    if (g(prev) > cur) {
      v.pop_back();
    } else {
      break;
    }
  }
  v.push_back(n);
}

void solve() {
  double minVal = INF;
  double tmp = 0;
  for (int i=1;i<100;i++) {
    check(i);
  }

  ll base = 1;
  while (base < 1e13) {
    for (int i=100;i<1000;i++) {
      ll val = i * base + base - 1;
      check(val);
    }
    base *= 10;
  }
  for (int i=0;i<k;i++) {
    cout << v[i] << endl;
  }
}

int main() {
  cin >> k;
  solve();
}
