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

using namespace std;
typedef long long ll;
ll s(ll x) {
  ll re = 0;
  while (x > 0) {
    re += x % 10;
    x /= 10;
  }
  return re;
}

bool cmp(ll x, ll y) {
  return x*s(y) <= y * s(x);
}

void solve(int K) {
  ll d = 1, cur = 0;
  rep(i, K) {
    ll x = cur + d;
    ll y = cur + d * 10;
    if (cmp(x, y)) {
      cur = x;
    } else {
      cur = y;
      d *= 10;
    }
    cout << cur << endl;
  }
}

int main() {
  int K;
  cin >> K;
  solve(K);
  return 0;
}