# hdu1027Ignatius and the Princess II <vector>

http://blog.sina.com.cn/s/blog_9f7ea4390101101u.html 讲next_permutation 好东西啊

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int n,m,i;
int main()
{
while(cin>>n>>m)
{
vector<int>ivec;
ivec.clear();
vector<int>::iterator iter;
for(i=1;i<=n;i++) ivec.push_back(i);
for(i=1;i<m;i++) next_permutation(ivec.begin(),ivec.end());
for(i=0,iter=ivec.begin();iter!=ivec.end();++i,++iter)//iter之前一直写成i编译提示我需要运算符重载orz
cout<<(i==0?"":" ")<<*iter;
cout<<endl;
}
return 0;
}


Problem Description
Now our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is about to kill our pretty Princess. But now the BEelzebub has to beat our hero first. feng5166 says, "I have three question for you, if you can work them out, I will release the Princess, or you will be my dinner, too." Ignatius says confidently, "OK, at last, I will save the Princess."

"Now I will show you the first problem." feng5166 says, "Given a sequence of number 1 to N, we define that 1,2,3...N-1,N is the smallest sequence among all the sequence which can be composed with number 1 to N(each number can be and should be use only once in this problem). So it's easy to see the second smallest sequence is 1,2,3...N,N-1. Now I will give you two numbers, N and M. You should tell me the Mth smallest sequence which is composed with number 1 to N. It's easy, isn't is? Hahahahaha......"
Can you help Ignatius to solve this problem?

Input
The input contains several test cases. Each test case consists of two numbers, N and M(1<=N<=1000, 1<=M<=10000). You may assume that there is always a sequence satisfied the BEelzebub's demand. The input is terminated by the end of file.

Output
For each test case, you only have to output the sequence satisfied the BEelzebub's demand. When output a sequence, you should print a space between two numbers, but do not output any spaces after the last number.

Sample Input
6 4 11 8

Sample Output
1 2 3 5 6 4 1 2 3 4 5 6 7 9 8 11 10

05-21 636

10-07 242

08-20 875

07-25 133

03-05 339

05-04 624

03-04 1510

05-09 1768

11-13 511

05-30 1700