hdu 1027 Ignatius and the Princess II

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int ans[10005];
int main()
{
int n,m,i;
while(scanf("%d%d",&n,&m)!=-1)
{
for(i=0;i<n;i++)ans[i]=i+1;
while(--m)
next_permutation(ans,ans+n);
printf("%d",ans[0]);
for(i=1;i<n;i++)
printf(" %d",ans[i]);
printf("\n");
}
return 0;
}