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<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<map>
#include<string>
#include<sstream>
using namespace std;
int inf = 1000000000;

int func(long long int k){
  string s = to_string(k);
  int tmp = 0;
  for(int i=0; i<s.size(); i++){
    tmp += s[i]-'0';
  }
  return tmp;
}

int main(){

  long long int k; cin >> k;

  long long int n = 1;
  long long int d = 1;
  cout << 1 << endl;
  for(long long int i=1; i<k; i++){
    if( func(n+d)*(n+d*10) < func(n+d*10)*(n+d) ) d *= 10;
    n += d;
    cout << n << endl;
  }

  return 0;
}



//
