#include<fstream>
#include <iostream>
using namespace std;
ifstream fin("planeta.in");
ofstream fout("planeta.out");
long long permutations[32];


void countNumberOfBTS(int n)
{
	permutations[0] = 1;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= i; j++)
		{
			permutations[i] += permutations[i - j] * permutations[j - 1];
		}
	}
}


void KthTraversal(int n, long long k, int beginning)
{
	if (n == 1) {
		fout << beginning + 1 << " ";
		return;
	}

	if (n == 0)
	{
		return;
	}

	for (int i = 1; i <= n; i++)
	{
		long long left = permutations[i - 1];
		long long right = permutations[n - i];
		long long total = left * right;

		if (total < k)
		{
			k -= total;
		}
		else
		{
			fout << beginning + i << " ";

			KthTraversal(i - 1, (k - 1) / right + 1, beginning);

			
			KthTraversal(n - i, (k - 1) % right + 1, beginning + i);
			return;
		}
	}
}

int main()
{
	int n;
	long long k;
	fin >> n >> k;

	countNumberOfBTS(n);
	KthTraversal(n, k, 0);

}