#include #include using int64 = long long; const int N = 51, S = 1e5 + 10; int64 dp[N][S]; int a[N]; int main() { memset(dp, -1, sizeof(dp)); int n, m; scanf("%d%d", &n, &m); for (int i = 0; i < n; ++i) { scanf("%d", &a[i]); } auto update = [&](int64 &x, int64 y) { if (x == -1 || x > y) x = y; }; dp[0][0] = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j <= m; ++j) if (dp[i][j] != -1) { if (j + a[i] <= m) update(dp[i + 1][j + a[i]], dp[i][j]); if (j * a[i] <= m) update(dp[i + 1][j * a[i]], dp[i][j] | (1ll << (n - i))); } } for (int i = n - 1; i > 0; --i) { if (dp[n][m] >> i & 1) putchar('*'); else putchar('+'); } puts(""); return 0; }