{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eThe harmonic value of the permutation $p_1,p_2,\\cdots p_n$ is\u003cbr\u003e$$\\sum_{i\u003d1}^{n-1} gcd(p_i.p_{i+1})$$\u003cbr\u003eMr. Frog is wondering about the permutation whose harmonic value is the strictly k-th smallest among all the permutations of [n].\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains only one integer T ($1\\leq T\\leq 100$), which indicates the number of test cases.\u003cbr\u003e\u003cbr\u003eFor each test case, there is only one line describing the given integers n and k ($1\\leq 2k \\leq n \\leq10000$)."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output one line “Case #x: $p_1\\ p_2\\ \\cdots \\ p_n$”, where x is the case number (starting from 1) and $p_1\\ p_2\\ \\cdots \\ p_n$ is the answer."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n4 1\r\n4 2\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 4 1 3 2\r\nCase #2: 2 4 1 3\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}