{"trustable":false,"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":"MD","content":"我们知道一个集合的非空子集就是从原先的集合选出一些元素(最少一个)组成的一个集合。如{$1,2,3$}的非空子集可为{$1,2$},{$1$},{$1,2,3$}$,但${$4$},{},不是。\n我们规定:\n(1)两个集合是不同中只要有一个位置的元素是不同的便是不同的,如${2,1}$和${1,2}$是不同的,${1}$和${1,2}$是不同的。而${1,2,3}$和${1,2,3}$是相同的集合\n(2)集合$A$集合大于$B$集合当且仅当$A$集合中存在一个位置$i$ ,使得$A_i \u003e B_i$ ,且对于任意$ j \u003c i$,都有 $A_j \u003d B_j$,如 $ A \u003d ${$1,2,4$}$,B \u003d ${$1,2,3$},$A \u003e B$,因为$A_3 \u003e B _3 且对于 A_1 \u003d B_1,A_2 \u003d B_2,$特别的 :A \u003d{$1,2$}$\u003eB$\u003d {$1$}\n\n现在给你一个$n$,你要得出他的第$m$小的子集"}},{"title":"Input","value":{"format":"MD","content":"The input contains several test cases. Each test case consists of two numbers n and m ( 0\u0026lt; n\u0026lt;\u003d 20, 0\u0026lt; m\u0026lt;\u003d the total number of the subset sequence of An )."}},{"title":"Output","value":{"format":"MD","content":"For each test case, you should output the m-th subset sequence of An in one line."}},{"title":"Sample Input","value":{"format":"MD","content":"\u003cpre\u003e1 1\n2 1\n2 2\n2 3\n2 4\n3 10\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"MD","content":"\u003cpre\u003e1\n1\n1 2\n2\n2 1\n2 3 1\u003c/pre\u003e"}}]}