#include <cstdio>
#include <ctime>
#include <algorithm>
using namespace std;

#define NMAX 50001

int i, N, S;
int LM, LP, sum;

int v[NMAX];
int P[NMAX], M[NMAX];

int x;
bool Conf[NMAX];

int main() {
	freopen("semne.in","r",stdin);
	freopen("semne.out","w",stdout);
	scanf("%i%i", &N, &S);
	srand(time(NULL));
	for (i = 0; i < N; ++i) {
		scanf("%i", &v[i]);
		x = rand() % 2;
		Conf[i] = x;
		if (!x) {
			sum += (1LL * v[i]);
            P[LP++] = i;
        }
        else {
            sum -= (1LL * v[i]);
            M[LM++] = i;
        }
    }
    while (sum != S) {
        if (sum > S) {
            x = rand() % LP;
            sum -= (2 * v[P[x]]);
            M[LM++] = P[x];
            Conf[P[x]] = 1 - Conf[P[x]];
            swap(P[x], P[--LP]);
        }
        else {
            x = rand() % LM;
            sum += (2 * v[M[x]]);
            P[LP++]= M[x];
            Conf[M[x]] = 1 - Conf[M[x]];
            swap(M[x], M[--LM]);
        }
    }
    for (i = 0; i < N; ++i) {
        if (!Conf[i])
            printf("+");
        else
            printf("-");
	}
	return 0;
}