{"raw_statement":[{"iden":"problem statement","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$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^4$\n*   $|M| \\leq N\\times 10^6$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$"},{"iden":"sample input 1","content":"3 9"},{"iden":"sample output 1","content":"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."},{"iden":"sample input 2","content":"5 -15"},{"iden":"sample output 2","content":"\\-15 -5 0 2 3\n\n$M$ may be negative."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}