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

unsigned long long calc(unsigned long long n) {
	unsigned long long sunuke = 0;
	while (n) {
		sunuke += n % 10;
		n /= 10;
	}
	return sunuke;
}

bool check(unsigned long long n, unsigned long long base) {
	return n*calc(n+base) <= calc(n)*(n+base);
}

int main() {
	unsigned long long k;
	cin >> k;
	unsigned long long n = 0;
	unsigned long long base = 1;
	unsigned long long cnt = 0;
	while (1) {
		if (cnt >= k)return 0;
		if (!check(n + base, base))base *= 10;
		n += base;
		cout << n << endl;
		++cnt;
	}
	return 0;
}