#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int MAX_N = 16;

int n, k;
vector<int> v;

bool valid(vector<int> &v) {
	int mic[MAX_N], mare[MAX_N];

	mic[1] = 0;
	for (int i = 0; i < n; ++i)
		for (int j = v[i] + 1; j <= n; ++j)
			mic[j] = i;

	mare[n] = n+1;
	for (int i = n-1; i >= 0; --i)
		for (int j = v[i] - 1; j; --j)
			mare[j] = i;

	for (int i = 1; i <= n; ++i)
		if (mic[i] > mare[i])
			return false;
	return true;
}

int main() {
	freopen("planeta.in", "r", stdin);
	freopen("planeta.out", "w", stdout);

	scanf("%d %d", &n, &k);

	for (int i = 1; i <= n; ++i)
		v.push_back(i);
	int cnt = 0;
	do {
		if (valid(v)) ++cnt;
		if (cnt == k) break;
	} while (next_permutation(v.begin(), v.end()));

	for (int i = 0; i < n; ++i)
		printf("%d ", v[i]);
}