{"raw_statement":[{"iden":"problem statement","content":"Let $S(n)$ denote the sum of the digits in the decimal notation of $n$. For example, $S(123) = 1 + 2 + 3 = 6$.\nWe 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.\nGiven an integer $K$, list the $K$ smallest Snuke numbers."},{"iden":"constraints","content":"*   $1 \\leq K$\n*   The $K$\\-th smallest Snuke number is not greater than $10^{15}$."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$K$"},{"iden":"sample input 1","content":"10"},{"iden":"sample output 1","content":"1\n2\n3\n4\n5\n6\n7\n8\n9\n19"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}