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

const int MAX_N = 16;

int n, k;
vector<int> v;

bool valid(int st, int dr) {
	if (st == dr) return true;
	int m;
	for (m = st + 1; m <= dr; ++m)
		if (v[m] > v[st]) break;
	for (int i = m; i <= dr; ++i)
		if (v[i] < v[st]) return false;
	return valid(st, m-1) && valid(m, dr);
}

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(0, n)) ++cnt;
		if (cnt == k) break;
	} while (next_permutation(v.begin(), v.end()));

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