#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
FILE *in,*out;
long long a[40],k;
int rez[50];
void cauta(long long d,int n,int cnt,int poz)
{
	printf("%lld %d %d %d\n",d,n,cnt,poz);
	int i;
	if (n==0)
		return ;
	if (n==1)
	{
		rez[poz]=cnt+1;
		return ;
	}
	long long s=0;
	for(i=1;(s+a[i-1]*a[n-i])*d<k;i++)
	{
		s+=a[i-1]*a[n-i];
	}
	rez[poz]=i+cnt;
	k-=s*d;
	cauta(d*a[n-i],i-1,cnt,poz+1);
	cauta(d,n-i,cnt+i,poz+i);
}
int main()
{
	int n,i,j;
	in=fopen("planeta.in","r");
	out=fopen("planeta.out","w");
	fscanf(in,"%d %lld",&n,&k);
	a[0]=1;
	FOR(i,1,n)
		FOR(j,1,i)
			a[i]+=a[j-1]*a[i-j];
	cauta(1,n,0,1);
	FOR(i,1,n)
		fprintf(out,"%d ",rez[i]);

	fclose(in);
	fclose(out);
	return 0;
}