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 <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()

typedef long long lint;

using namespace std;

int S(lint N){
  int r=0;
  while(N>0){
    r+=N%10;
    N/=10;
  }
  return r;
}

lint N_max(lint N){
  lint r=1;
  while(N>0){
    r*=10;
    N/=10;
  }
  return r;
}

int main(){
  lint K;
  cin>>K;
  lint A=1;
  REP(i,K){
    cout<<A<<endl;
    lint B=A+1;
    lint M=N_max(B);
    lint C=B;
    lint base=1;
    while(B<M){
      if(C*S(B)>B*S(C))C=B;
      if(B%(base*10)==base*10-1)base*=10;
      B+=base;
    }
    A=C;
  }
  return 0;
}
