# Subset sequence

Time Limit: 1000/1000 MS (Java/Others)

Memory Limit: 32768/32768 K (Java/Others)

[显示标签]

## Description

Consider the aggregate An= { 1, 2, …, n }. For example, A1={1}, A3={1,2,3}. A subset sequence is defined as a array of a non-empty subset. Sort all the subset sequece of An in lexicography order. Your task is to find the m-th one.

## Input

The input contains several test cases. Each test case consists of two numbers n and m ( 0< n<= 20, 0< m<= the total number of the subset sequence of An ).

## Output

For each test case, you should output the m-th subset sequence of An in one line.

## Sample Input

1 1
2 1
2 2
2 3
2 4
3 10

## Sample Output

1
1
1 2
2
2 1
2 3 1

linle