STL偷懒法= =
#include<cstdio>
#include<algorithm>
using namespace std;
int seq[1010];
int main()
{
int n, m;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i = 0; i < n; i++)
seq[i] = i + 1;
m -= 1;
while(m--)
{
next_permutation(seq, seq+n);//prev_permutation()生成前一个排列,next_permutation()生成后一个排列,返回值是bool型
}
printf("%d",seq[0]);
for(int i = 1; i < n; i++)
printf(" %d",seq[i]);
printf("\n");
}
}