{"problem":{"name":"Non Arithmetic Progression Set","description":{"content":"Construct a set $S$ of integers satisfying all of the conditions below. It can be proved that at least one such set $S$ exists under the Constraints of this problem. *   $S$ has exactly $N$ elements.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc145_d"},"statements":[{"statement_type":"Markdown","content":"Construct a set $S$ of integers satisfying all of the conditions below. It can be proved that at least one such set $S$ exists under the Constraints of this problem.\n\n*   $S$ has exactly $N$ elements.\n*   The element of $S$ are distinct integers between $-10^7$ and $10^7$ (inclusive).\n*   $\\displaystyle \\sum _{s \\in S} s = M$.\n*   $y-x\\neq z-y$ for every triple $x,y,z$ $(x < y < z)$ of distinct elements in $S$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^4$\n*   $|M| \\leq N\\times 10^6$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc145_d","tags":[],"sample_group":[["3 9","1 2 6\n\nWe have $2-1 \\neq 6-2$ and $1+2+6=9$, so this output satisfies the conditions. Many other solutions exist."],["5 -15","\\-15 -5 0 2 3\n\n$M$ may be negative."]],"created_at":"2026-03-03 11:01:14"}}