#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n, T;
        cin >> n >> T;

        vector<int> a(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }

        vector dp(n, vector<int>(T + 1));
        dp[n - 1][T] = true;

        for (int i = n - 1; i > 0; i--) {
            for (int j = 0; j <= T; j++) {
                if (j + a[i] <= T && dp[i][j + a[i]]) {
                    dp[i - 1][j] = true;
                }
                if (j * a[i] <= T && dp[i][j * a[i]]) {
                    dp[i - 1][j] = true;
                }
            }
        }

        assert(dp[0][a[0]]);

        for (int i = 1, j = a[0]; i < n; i++) {
            if (j + a[i] <= T && dp[i][j + a[i]]) {
                cout << '+';
                j += a[i];
            } else if (j * a[i] <= T && dp[i][j * a[i]]) {
                cout << '*';
                j *= a[i];
            } else {
                assert(false);
            }
        }
    };
    
    solve();
    
    return 0;
}