#include <bits/stdc++.h>

#define MaxN 35
#define INF 2140000000
#define INFLL 4611686018427387904

using namespace std;

FILE *IN,*OUT;

int N;
long long K,d[MaxN];

void Solve(int s,int e,long long pos)
{
    if(s==e)
    {
        fprintf(OUT,"%d ",s);
        return;
    }
    if(s>e)return;
    int p=s;

    while(d[p-s]*d[e-p]<pos)
        pos-=d[p-s]*d[e-p],p++;

    fprintf(OUT,"%d ",p);

    Solve(s,p-1,1+(pos-1)/d[e-p]);
    Solve(p+1,e,pos-((pos-1)/d[e-p])*d[e-p]);
}

int main()
{
    IN=fopen("planeta.in","r");
    OUT=fopen("planeta.out","w");

    fscanf(IN,"%d%lld",&N,&K);

    d[0]=d[1]=1;

    for(int i=2;i<=N;i++)
        for(int j=0;j<i;j++)
            d[i]+=d[j]*d[i-j-1];

    Solve(1,N,K);

    return 0;
}