num2part

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

long long n, k;
long long d[110][110];


int main() {
    freopen("num2part.in", "r", stdin);
    freopen("num2part.out", "w", stdout);
    cin >> n >> k;
    k++;
    d[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            d[i][j] = d[i - j][0];
            for (int q = j; q <= (i - j); q++) {
                d[i][j] += d[i - j][q];
            }
        }
    }

    bool first = true;
    int iter = 1;
    int cnt = 0;
    while (n > 0) {
        cnt++;
        while (d[n][iter] < k) {
            k -= d[n][iter];
            iter++;
        }
        if (first) {
            first = false;
            cout << iter;
        }
        else {
            cout << "+" << iter;
        }
        n -= iter;
    }

    return 0;
}