{"problem":{"name":"Subarray Sum","description":{"content":"Given are three integers $N$, $K$, and $S$. Find 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 con","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"keyence2020_c"},"statements":[{"statement_type":"Markdown","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$.\n\n## Constraints\n\n*   $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.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$ $S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"keyence2020_c","tags":[],"sample_group":[["4 2 3","1 2 3 4\n\nTwo pairs $(l, r) = (1, 2)$ and $(3, 3)$ satisfy the condition in the statement."],["5 3 100","50 50 50 30 70"]],"created_at":"2026-03-03 11:01:14"}}