{"raw_statement":[{"iden":"problem statement","content":"The **happiness** of a permutation $P=(P_1,P_2,\\ldots,P_N)$ of $(1,\\dots,N)$ is defined as follows.\n\n*   Let $A=(A_1,A_2,\\ldots,A_{N-1})$ be a sequence of length $N-1$ with $A_i = |P_i-P_{i+1}|(1\\leq i \\leq N-1)$. The happiness of $P$ is the length of a longest strictly increasing subsequence of $A$.\n\nPrint a permutation $P$ such that $P_1 = X$ with the greatest happiness."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 2\\times 10^5$\n*   $1 \\leq X \\leq N$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $X$"},{"iden":"sample input 1","content":"3 2"},{"iden":"sample output 1","content":"2 1 3\n\nSince $A=(1,2)$, the happiness of $P$ is $2$, which is the greatest happiness achievable, so the output meets the requirement."},{"iden":"sample input 2","content":"3 1"},{"iden":"sample output 2","content":"1 2 3\n\nSince $A=(1,1)$, the happiness of $P$ is $1$, which is the greatest happiness achievable, so the output meets the requirement."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}