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 ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)

int K;

int S(ll N) {
  if(N < 10) return N;
  return (N % 10) + S(N/10);
}

ll f(ll N) {
  vector<pair<double,ll>> res;
  for(ll m = 1; m <= N*10; m *= 10) {
    ll k = m*(N/m + 1) - 1;
    res.push_back(pair<double,ll>((double)k/S(k), k));
  }
  sort(res.begin(), res.end());
  return res[0].second;
}

int main () {
  cin >> K;

  ll N = 1;
  rep(i,K) {
    printf("%lld\n", N);
    N = f(N+1);
  }
  return 0;
}
