{"raw_statement":[{"iden":"problem statement","content":"Given are three integers $N$, $K$, and $S$.\nFind a sequence $A_1, A_2, ..., A_N$ of $N$ integers between $1$ and $10^9$ (inclusive) that satisfies the condition below. We can prove that, under the conditions in Constraints, such a sequence always exists.\n\n*   There are exactly $K$ pairs $(l, r)$ of integers such that $1 \\leq l \\leq r \\leq N$ and $A_l + A_{l + 1} + \\cdots + A_r = S$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^5$\n*   $0 \\leq K \\leq N$\n*   $1 \\leq S \\leq 10^9$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$ $S$"},{"iden":"sample input 1","content":"4 2 3"},{"iden":"sample output 1","content":"1 2 3 4\n\nTwo pairs $(l, r) = (1, 2)$ and $(3, 3)$ satisfy the condition in the statement."},{"iden":"sample input 2","content":"5 3 100"},{"iden":"sample output 2","content":"50 50 50 30 70"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}