#include <bits/stdc++.h>

using namespace std;

int N, k;
vector<int> nowobj;
vector<int> elements;

void find_seq(int n = N, int left = k) {
    if (n == 0) {
        return;
    }
    int fact = 1;
    for (int i = 1; i <= n - 1; ++i) {
        fact *= i;
    }
    int ind = left / fact;
    int number = elements[ind];
    cout << number << ' ';
    elements.erase(elements.begin() + ind);
    left -= fact * ind;
    find_seq(n - 1, left);
}

int main() {
    cin >> N >> k;
    nowobj.resize(N);
    for (int i = 1; i <= N; ++i) {
        elements.push_back(i);
    }
    find_seq();
}