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>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

typedef long long ll;

ll sumOfDigit(ll x)
{
  ll ret = 0;
  while (x) {
    ret += x % 10;
    x /= 10;
  }
  return ret;
}
ll f(ll N)
{
  vector<pair<double, ll>> v;
  string S = to_string(N);
  for (int i = 0; i <= S.size(); i++) {
    string T(S);
    for (int j = 0; j < i; j++) {
      T[T.size() - j - 1] = '9';
    }
    ll num = stoll(T);
    v.push_back(make_pair((double)num/sumOfDigit(num), num));
  }
  return min_element(v.begin(), v.end())->second;
}

int main()
{
  ll K;
  cin >> K;

  ll N = 1;
  for (int i = 0; i < K; i++) {
    cout << N << endl;
    N = f(N + 1);
  }
  return 0;
}