#include <stdio.h>
#include <stdlib.h>
#include <string.h>

char permutations[40320][10];
int permCount = 0;

void backtrack(int* path, int pathLen, int* remaining, int remLen, int n) {
    if (remLen == 0) {
        for (int i = 0; i < pathLen; i++) {
            permutations[permCount][i] = path[i] + '0';
        }
        permutations[permCount][pathLen] = '\0';
        permCount++;
        return;
    }
    for (int i = 0; i < remLen; i++) {
        path[pathLen] = remaining[i];
        int newRemaining[10];
        int newRemLen = 0;
        for (int j = 0; j < remLen; j++) {
            if (j != i) {
                newRemaining[newRemLen++] = remaining[j];
            }
        }
        backtrack(path, pathLen + 1, newRemaining, newRemLen, n);
    }
}

int compare(const void* a, const void* b) {
    return strcmp((char*)a, (char*)b);
}

char* solution(int n, int k) {
    permCount = 0;
    int numbers[10];
    for (int i = 1; i <= n; i++) {
        numbers[i-1] = i;
    }
    int path[10];
    backtrack(path, 0, numbers, n, n);
    qsort(permutations, permCount, sizeof(permutations[0]), compare);
    return permutations[k-1];
}

int main() {
    int n, k;
    scanf("%d", &n);
    scanf("%d", &k);
    char* result = solution(n, k);
    printf("%s\n", result);
    return 0;
}