#include <cstdio>
#include <algorithm>
#define FIN "planeta.in"
#define FOUT "planeta.out"
#define N 35

int v[N],n,k;

using namespace std;

void read()
{
     int i;
     freopen(FIN,"r",stdin);     
     scanf("%d%d", &n, &k);
     for (i = 1;i <= n; ++i)
         v[i] = i;
}
void solve()
{
     int i = 1;
     while ( i < k)
     {
           next_permutation(v + 1, v + n + 1);
           ++i;
     }
}
void write()
{
     int i;
     freopen(FOUT,"w",stdout);     
     for (i = 1;i <= n-1; ++i)
          printf("%d ", v[i]);
     printf("%d\n", v[n]);
}
int main()
{
    read();
    solve();
    write();    
}