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;
using ll = long long;

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

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

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll K;
  cin >> K;

  vector<ll> res;
  ll base = 1;
  for (int i = 0; i < 15; i++) {
    for (int j = 1; j < 150; j++) {
      res.push_back(base * (j + 1) - 1);
    }
    base *= 10;
  }
  sort(res.begin(), res.end());
  res.erase(unique(res.begin(), res.end()), res.end());

  for (ll i = 0; i < res.size(); i++) {
    for (ll j = i + 1; j < res.size(); j++) {
      if (g(res[i]) > g(res[j])) {
        res.erase(res.begin() + i--);
        break;
      }
    }
  }

  for (ll i = 0; i < K; i++)
    cout << res[i] << '\n';
  return 0;
}
