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 <cstdio>
using namespace std;
 
int k;

int sumDig(long long x) {
  int res = 0;
	while (x) {
		res += x % 10;
		x /= 10;
  }
	return res;
}
 
int main() {
  scanf("%d", &k);
 	long long num = 1, add = 1;
  while (k--) {
    printf("%lld\n", num);
    while (double(num + add) / sumDig(num + add) > double(num + 2 * add) / sumDig(num + 2 * add)) add *= 10;
    num += add;
  }
  return 0;
}