#include<cstdio>
using namespace std;
int n;
long long k,D[36]={1LL};
void rec(long long k, int p, int u)
{
    if (u<p) return ;
    int i=u-p+1,j=1;
    long long s=k;
    while (D[j-1]*D[i-j]<k && j<=i)
        k-=D[j-1]*D[i-j], ++j;
    printf("%d ",p+j-1);
    rec((k-1)/D[i-j]+1,p,p+j-2);
    rec((k-1)%D[i-j]+1,p+j,u);
}
int main()
{
    int i,j;
    freopen("planeta.in","r",stdin);
    freopen("planeta.out","w",stdout);
    scanf("%d%lld",&n,&k);
    for (i=1;i<=n;++i)
        for (j=1;j<=i;++j)
            D[i]+=D[j-1]*D[i-j];
    rec(k,1,n);
    printf("\n");
    return 0;
}