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 <bits/stdc++.h>
using namespace std;

pair<long long, int> a[1111];
int top;
void pus(long long x) {
	int sum = 0;
	for (long long y = x; y; y /= 10) sum += y%10;
	while (top > 0 && a[top-1].first * sum > a[top-1].second * x) top --;
	a[top++] = make_pair(x, sum);
}

int main() {
	int k; cin >> k;
	for (int i = 1; i < 1000000; i ++) pus(i); 
	long long cur = 10;
	for (int p = 7; p <= 15; p ++, cur *= 10) {
		for (int i = 100000; i < 1000000; i ++) pus((i+1) * cur - 1);
	}
	for (int i = 0; i < k; i ++) cout << a[i].first << endl;
	return 0;
}