#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <algorithm>

#define maxn 50000
#define fout out

FILE *in = fopen("semne.in","r"), *out = fopen("semne.out","w");

int a[maxn];
char semn[maxn];

int n;
long long s;
long long sol = 0;

void read()
{
    fscanf(in, "%d %lld", &n, &s);

    for ( int i = 0; i < n; ++i )
    {
        fscanf(in, "%d", &a[i]);
        if ( sol < s )
        {
            sol += a[i];
            semn[i] = 1;
        }
        else
        {
            sol -= a[i];
            semn[i] = -1;
        }
    }
//    std::sort(a, a+n);
}

int main()
{
    read();
    srand(time(0));

    while ( sol != s )
    {
        int q = rand();
        if ( q >= n )
            q %= n;

        if ( sol < s && semn[q] == -1 )
            sol += (a[q]<<1) * (semn[q] = 1);
        else if ( sol > s && semn[q] == 1 )
            sol += (a[q]<<1) * (semn[q] = -1);
    }

    for ( int i = 0; i < n; ++i )
        if ( semn[i] == -1 )
            fprintf(fout, "-");
        else
            fprintf(fout, "+");



	return 0;
}