//No.10 ＋か×か
#include <iostream>
#include <bitset>
#define N_MAX 50
typedef unsigned long long LL;
using namespace std;

int N, T, A[N_MAX];

LL cal(int t, int i)
{
	if (t == T && i >= N)
		return 0;
	if (t > T || i >= N)
		return -1;

	LL ans = cal(t + A[i], i + 1);
	if (ans != -1)
		return ans;

	ans = cal(t * A[i], i + 1);
	if (ans != -1)
		return ans | ((LL)1 << i);

	return -1;
}

int main()
{
	const char* op = "+*";

	cin >> N >> T;
	for (int i = 0; i < N; ++i)
		cin >> A[i];

	//計算
	bitset<64> ans(cal(A[0], 1));
	for (int i = 1; i < N; ++i)
		cout << op[ans[i]];
	cout << endl;

	int test = A[0];
	for (int i = 1; i < N; ++i)
	{
		if (ans[i])
		{
			test *= A[i];
			cout << "* " << A[i] << "\t= " << test << endl;
		}
		else
		{
			test += A[i];
			cout << "+ " << A[i] << "\t= " << test << endl;
		}
	}
	cout << test << endl;

	return 0;
}