#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
vector <int> noduri;
ifstream f("planeta.in");
ofstream g("planeta.out");
int n, k, nr;
///merge in 5 ani, dar macar merge :D
int preordine(int stanga, int dreapta)
{
    if(stanga>=dreapta)
        return 1;
    int radacina=noduri[stanga], index=stanga+1;
    //parcurg nodurile din subarborele stang
    while(noduri[index]<radacina && index<=dreapta)
        index++;
    //verific daca numerele din subarborele drept sunt mai mici decat radacina si returnez 0 in caz afirmativ
    for(int i=index+1; i<=dreapta; i++)
        if(noduri[i]<radacina)
            return 0;
    return preordine(stanga+1, index-1) && preordine(index, dreapta);
}

void bst(int n)
{
    for(int i=1; i<=n; i++)
        noduri.push_back(i);
    nr++;
    while(next_permutation(noduri.begin(), noduri.end()))
    {
        if(preordine(0, n-1)==1)
        {
            nr++;
            if(nr==k)
            {
                for(int i=0; i<n; i++)
                    g<<noduri[i]<<" ";
                return;
            }
        }
    }
}
int main()
{
    f>>n>>k;
    bst(n);
    return 0;
}