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

using namespace std;

int s(string n){
  int ret = 0;
  for (auto it = n.begin(); it != n.end(); ++it){
    ret += *it - '0';
  }
  return ret;
}


bool test(string n, int keta){
  int intn = stoi(n.substr(0,n.size()-keta));
  int sint = s(n);
  if (keta!=0) ++intn;
  return sint >= intn;
}

int main(){
  int K;
  cin >> K;
  string bgn = "";
  int counter = 1;
  int keta = 0;
  int cnt =0;
  
  while(cnt < K){
    
    string res = to_string(counter)+bgn;
    if (test(res, keta)){
      cout << res << endl;
      ++counter;
      ++cnt;
    }else{
      ++keta;
      bgn+='9';
      counter /= 10;
    }
  }
  return 0;
}